H-Termination proof of /home/matraf/haskell/eval_FullyBlown

YES 5.8180000000000005 H-Termination proof of /home/matraf/haskell/eval_FullyBlown_Fast/List.hs
H-Termination of the given Haskell-Program with start terms could successfully be proven:

↳ HASKELL

  ↳ LR

mainModule List

((intersect :: [Ratio Int] -> [Ratio Int] -> [Ratio Int]) :: [Ratio Int] -> [Ratio Int] -> [Ratio Int])

module List where

import qualified Maybe
import qualified Prelude

intersect :: Eq a => [a] -> [a] -> [a]

intersect

intersectBy (==)

intersectBy :: (a -> a -> Bool) -> [a] -> [a] -> [a]

intersectBy

eq xs ys

concatMap (\vv2 ->

case	vv2 of
	x	->	if any (eq x) ys then x : [] else []
	_	->	[]

) xs

module Maybe where

import qualified List
import qualified Prelude

Lambda Reductions:
The following Lambda expression

\vv2→

case vv2 of
x → if any (eq x) ys then x : [] else []

_ → []

is transformed to

intersectBy0 eq ys vv2 =

case vv2 of
x → if any (eq x) ys then x : [] else []

_ → []

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

mainModule List

((intersect :: [Ratio Int] -> [Ratio Int] -> [Ratio Int]) :: [Ratio Int] -> [Ratio Int] -> [Ratio Int])

module List where

import qualified Maybe
import qualified Prelude

intersect :: Eq a => [a] -> [a] -> [a]

intersect

intersectBy (==)

intersectBy :: (a -> a -> Bool) -> [a] -> [a] -> [a]

intersectBy

eq xs ys

concatMap (intersectBy0 eq ys) xs

intersectBy0

eq ys vv2

case	vv2 of
	x	->	if any (eq x) ys then x : [] else []
	_	->	[]

module Maybe where

import qualified List
import qualified Prelude

Case Reductions:
The following Case expression

case vv2 of
x → if any (eq x) ys then x : [] else []

_ → []

is transformed to

intersectBy00 eq ys x = if any (eq x) ys then x : [] else []

intersectBy00 eq ys _ = []

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

mainModule List

((intersect :: [Ratio Int] -> [Ratio Int] -> [Ratio Int]) :: [Ratio Int] -> [Ratio Int] -> [Ratio Int])

module List where

import qualified Maybe
import qualified Prelude

intersect :: Eq a => [a] -> [a] -> [a]

intersect

intersectBy (==)

intersectBy :: (a -> a -> Bool) -> [a] -> [a] -> [a]

intersectBy

eq xs ys

concatMap (intersectBy0 eq ys) xs

intersectBy0

eq ys vv2

intersectBy00 eq ys vv2

intersectBy00	eq ys x	=	if any (eq x) ys then x : [] else []
intersectBy00	eq ys _	=	[]

module Maybe where

import qualified List
import qualified Prelude

If Reductions:
The following If expression

if any (eq x) ys then x : [] else []

is transformed to

intersectBy000 x True = x : []

intersectBy000 x False = []

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

mainModule List

((intersect :: [Ratio Int] -> [Ratio Int] -> [Ratio Int]) :: [Ratio Int] -> [Ratio Int] -> [Ratio Int])

module List where

import qualified Maybe
import qualified Prelude

intersect :: Eq a => [a] -> [a] -> [a]

intersect

intersectBy (==)

intersectBy :: (a -> a -> Bool) -> [a] -> [a] -> [a]

intersectBy

eq xs ys

concatMap (intersectBy0 eq ys) xs

intersectBy0

eq ys vv2

intersectBy00 eq ys vv2

intersectBy00	eq ys x	=	intersectBy000 x (any (eq x) ys)
intersectBy00	eq ys _	=	[]

intersectBy000	x True	=	x : []
intersectBy000	x False	=	[]

module Maybe where

import qualified List
import qualified Prelude

Replaced joker patterns by fresh variables and removed binding patterns.

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

mainModule List

((intersect :: [Ratio Int] -> [Ratio Int] -> [Ratio Int]) :: [Ratio Int] -> [Ratio Int] -> [Ratio Int])

module List where

import qualified Maybe
import qualified Prelude

intersect :: Eq a => [a] -> [a] -> [a]

intersect

intersectBy (==)

intersectBy :: (a -> a -> Bool) -> [a] -> [a] -> [a]

intersectBy

eq xs ys

concatMap (intersectBy0 eq ys) xs

intersectBy0

eq ys vv2

intersectBy00 eq ys vv2

intersectBy00	eq ys x	=	intersectBy000 x (any (eq x) ys)
intersectBy00	eq ys vw	=	[]

intersectBy000	x True	=	x : []
intersectBy000	x False	=	[]

module Maybe where

import qualified List
import qualified Prelude

Cond Reductions:
The following Function with conditions

undefined

| False

= undefined

is transformed to

undefined = undefined1

undefined0 True = undefined

undefined1 = undefined0 False

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ Narrow

mainModule List

(intersect :: [Ratio Int] -> [Ratio Int] -> [Ratio Int])

module List where

import qualified Maybe
import qualified Prelude

intersect :: Eq a => [a] -> [a] -> [a]

intersect

intersectBy (==)

intersectBy :: (a -> a -> Bool) -> [a] -> [a] -> [a]

intersectBy

eq xs ys

concatMap (intersectBy0 eq ys) xs

intersectBy0

eq ys vv2

intersectBy00 eq ys vv2

intersectBy00	eq ys x	=	intersectBy000 x (any (eq x) ys)
intersectBy00	eq ys vw	=	[]

intersectBy000	x True	=	x : []
intersectBy000	x False	=	[]

module Maybe where

import qualified List
import qualified Prelude

Haskell To QDPs

digraph dp_graph {
node [outthreshold=100, inthreshold=100];1[label="intersect",fontsize=16,color="grey",shape="box"];1 -> 3[label="",style="dashed", color="grey", weight=3];
3[label="intersect wv3",fontsize=16,color="grey",shape="box"];3 -> 4[label="",style="dashed", color="grey", weight=3];
4[label="intersect wv3 wv4",fontsize=16,color="black",shape="triangle"];4 -> 5[label="",style="solid", color="black", weight=3];
5[label="intersectBy (==) wv3 wv4",fontsize=16,color="black",shape="box"];5 -> 6[label="",style="solid", color="black", weight=3];
6[label="concatMap (intersectBy0 (==) wv4) wv3",fontsize=16,color="black",shape="box"];6 -> 7[label="",style="solid", color="black", weight=3];
7[label="concat . map (intersectBy0 (==) wv4)",fontsize=16,color="black",shape="box"];7 -> 8[label="",style="solid", color="black", weight=3];
8[label="concat (map (intersectBy0 (==) wv4) wv3)",fontsize=16,color="black",shape="box"];8 -> 9[label="",style="solid", color="black", weight=3];
9[label="foldr (++) [] (map (intersectBy0 (==) wv4) wv3)",fontsize=16,color="burlywood",shape="triangle"];4137[label="wv3/wv30 : wv31",fontsize=10,color="white",style="solid",shape="box"];9 -> 4137[label="",style="solid", color="burlywood", weight=9];
4137 -> 10[label="",style="solid", color="burlywood", weight=3];
4138[label="wv3/[]",fontsize=10,color="white",style="solid",shape="box"];9 -> 4138[label="",style="solid", color="burlywood", weight=9];
4138 -> 11[label="",style="solid", color="burlywood", weight=3];
10[label="foldr (++) [] (map (intersectBy0 (==) wv4) (wv30 : wv31))",fontsize=16,color="black",shape="box"];10 -> 12[label="",style="solid", color="black", weight=3];
11[label="foldr (++) [] (map (intersectBy0 (==) wv4) [])",fontsize=16,color="black",shape="box"];11 -> 13[label="",style="solid", color="black", weight=3];
12[label="foldr (++) [] (intersectBy0 (==) wv4 wv30 : map (intersectBy0 (==) wv4) wv31)",fontsize=16,color="black",shape="box"];12 -> 14[label="",style="solid", color="black", weight=3];
13[label="foldr (++) [] []",fontsize=16,color="black",shape="box"];13 -> 15[label="",style="solid", color="black", weight=3];
14 -> 16[label="",style="dashed", color="red", weight=0];
14[label="(++) intersectBy0 (==) wv4 wv30 foldr (++) [] (map (intersectBy0 (==) wv4) wv31)",fontsize=16,color="magenta"];14 -> 17[label="",style="dashed", color="magenta", weight=3];
15[label="[]",fontsize=16,color="green",shape="box"];17 -> 9[label="",style="dashed", color="red", weight=0];
17[label="foldr (++) [] (map (intersectBy0 (==) wv4) wv31)",fontsize=16,color="magenta"];17 -> 18[label="",style="dashed", color="magenta", weight=3];
16[label="(++) intersectBy0 (==) wv4 wv30 wv5",fontsize=16,color="black",shape="triangle"];16 -> 19[label="",style="solid", color="black", weight=3];
18[label="wv31",fontsize=16,color="green",shape="box"];19[label="(++) intersectBy00 (==) wv4 wv30 wv5",fontsize=16,color="black",shape="box"];19 -> 20[label="",style="solid", color="black", weight=3];
20[label="(++) intersectBy000 wv30 (any ((==) wv30) wv4) wv5",fontsize=16,color="black",shape="box"];20 -> 21[label="",style="solid", color="black", weight=3];
21[label="(++) intersectBy000 wv30 (or . map ((==) wv30)) wv5",fontsize=16,color="black",shape="box"];21 -> 22[label="",style="solid", color="black", weight=3];
22[label="(++) intersectBy000 wv30 (or (map ((==) wv30) wv4)) wv5",fontsize=16,color="black",shape="box"];22 -> 23[label="",style="solid", color="black", weight=3];
23[label="(++) intersectBy000 wv30 (foldr (||) False (map ((==) wv30) wv4)) wv5",fontsize=16,color="burlywood",shape="triangle"];4141[label="wv4/wv40 : wv41",fontsize=10,color="white",style="solid",shape="box"];23 -> 4141[label="",style="solid", color="burlywood", weight=9];
4141 -> 24[label="",style="solid", color="burlywood", weight=3];
4142[label="wv4/[]",fontsize=10,color="white",style="solid",shape="box"];23 -> 4142[label="",style="solid", color="burlywood", weight=9];
4142 -> 25[label="",style="solid", color="burlywood", weight=3];
24[label="(++) intersectBy000 wv30 (foldr (||) False (map ((==) wv30) (wv40 : wv41))) wv5",fontsize=16,color="black",shape="box"];24 -> 26[label="",style="solid", color="black", weight=3];
25[label="(++) intersectBy000 wv30 (foldr (||) False (map ((==) wv30) [])) wv5",fontsize=16,color="black",shape="box"];25 -> 27[label="",style="solid", color="black", weight=3];
26[label="(++) intersectBy000 wv30 (foldr (||) False (((==) wv30 wv40) : map ((==) wv30) wv41)) wv5",fontsize=16,color="black",shape="box"];26 -> 28[label="",style="solid", color="black", weight=3];
27[label="(++) intersectBy000 wv30 (foldr (||) False []) wv5",fontsize=16,color="black",shape="box"];27 -> 29[label="",style="solid", color="black", weight=3];
28[label="(++) intersectBy000 wv30 ((||) (==) wv30 wv40 foldr (||) False (map ((==) wv30) wv41)) wv5",fontsize=16,color="burlywood",shape="box"];4143[label="wv30/wv300 :% wv301",fontsize=10,color="white",style="solid",shape="box"];28 -> 4143[label="",style="solid", color="burlywood", weight=9];
4143 -> 30[label="",style="solid", color="burlywood", weight=3];
29[label="(++) intersectBy000 wv30 False wv5",fontsize=16,color="black",shape="box"];29 -> 31[label="",style="solid", color="black", weight=3];
30[label="(++) intersectBy000 (wv300 :% wv301) ((||) (==) wv300 :% wv301 wv40 foldr (||) False (map ((==) wv300 :% wv301) wv41)) wv5",fontsize=16,color="burlywood",shape="box"];4144[label="wv40/wv400 :% wv401",fontsize=10,color="white",style="solid",shape="box"];30 -> 4144[label="",style="solid", color="burlywood", weight=9];
4144 -> 32[label="",style="solid", color="burlywood", weight=3];
31[label="(++) [] wv5",fontsize=16,color="black",shape="triangle"];31 -> 33[label="",style="solid", color="black", weight=3];
32[label="(++) intersectBy000 (wv300 :% wv301) ((||) (==) wv300 :% wv301 wv400 :% wv401 foldr (||) False (map ((==) wv300 :% wv301) wv41)) wv5",fontsize=16,color="black",shape="box"];32 -> 34[label="",style="solid", color="black", weight=3];
33[label="wv5",fontsize=16,color="green",shape="box"];34[label="(++) intersectBy000 (wv300 :% wv301) ((||) wv300 == wv400 && wv301 == wv401 foldr (||) False (map ((==) wv300 :% wv301) wv41)) wv5",fontsize=16,color="black",shape="box"];34 -> 35[label="",style="solid", color="black", weight=3];
35[label="(++) intersectBy000 (wv300 :% wv301) ((||) primEqInt wv300 wv400 && wv301 == wv401 foldr (||) False (map ((==) wv300 :% wv301) wv41)) wv5",fontsize=16,color="burlywood",shape="box"];4145[label="wv300/Pos wv3000",fontsize=10,color="white",style="solid",shape="box"];35 -> 4145[label="",style="solid", color="burlywood", weight=9];
4145 -> 36[label="",style="solid", color="burlywood", weight=3];
4146[label="wv300/Neg wv3000",fontsize=10,color="white",style="solid",shape="box"];35 -> 4146[label="",style="solid", color="burlywood", weight=9];
4146 -> 37[label="",style="solid", color="burlywood", weight=3];
36[label="(++) intersectBy000 (Pos wv3000 :% wv301) ((||) primEqInt (Pos wv3000) wv400 && wv301 == wv401 foldr (||) False (map ((==) Pos wv3000 :% wv301) wv41)) wv5",fontsize=16,color="burlywood",shape="box"];4147[label="wv3000/Succ wv30000",fontsize=10,color="white",style="solid",shape="box"];36 -> 4147[label="",style="solid", color="burlywood", weight=9];
4147 -> 38[label="",style="solid", color="burlywood", weight=3];
4148[label="wv3000/Zero",fontsize=10,color="white",style="solid",shape="box"];36 -> 4148[label="",style="solid", color="burlywood", weight=9];
4148 -> 39[label="",style="solid", color="burlywood", weight=3];
37[label="(++) intersectBy000 (Neg wv3000 :% wv301) ((||) primEqInt (Neg wv3000) wv400 && wv301 == wv401 foldr (||) False (map ((==) Neg wv3000 :% wv301) wv41)) wv5",fontsize=16,color="burlywood",shape="box"];4149[label="wv3000/Succ wv30000",fontsize=10,color="white",style="solid",shape="box"];37 -> 4149[label="",style="solid", color="burlywood", weight=9];
4149 -> 40[label="",style="solid", color="burlywood", weight=3];
4150[label="wv3000/Zero",fontsize=10,color="white",style="solid",shape="box"];37 -> 4150[label="",style="solid", color="burlywood", weight=9];
4150 -> 41[label="",style="solid", color="burlywood", weight=3];
38[label="(++) intersectBy000 (Pos (Succ wv30000) :% wv301) ((||) primEqInt (Pos (Succ wv30000)) wv400 && wv301 == wv401 foldr (||) False (map ((==) Pos (Succ wv30000) :% wv301) wv41)) wv5",fontsize=16,color="burlywood",shape="box"];4151[label="wv400/Pos wv4000",fontsize=10,color="white",style="solid",shape="box"];38 -> 4151[label="",style="solid", color="burlywood", weight=9];
4151 -> 42[label="",style="solid", color="burlywood", weight=3];
4152[label="wv400/Neg wv4000",fontsize=10,color="white",style="solid",shape="box"];38 -> 4152[label="",style="solid", color="burlywood", weight=9];
4152 -> 43[label="",style="solid", color="burlywood", weight=3];
39[label="(++) intersectBy000 (Pos Zero :% wv301) ((||) primEqInt (Pos Zero) wv400 && wv301 == wv401 foldr (||) False (map ((==) Pos Zero :% wv301) wv41)) wv5",fontsize=16,color="burlywood",shape="box"];4153[label="wv400/Pos wv4000",fontsize=10,color="white",style="solid",shape="box"];39 -> 4153[label="",style="solid", color="burlywood", weight=9];
4153 -> 44[label="",style="solid", color="burlywood", weight=3];
4154[label="wv400/Neg wv4000",fontsize=10,color="white",style="solid",shape="box"];39 -> 4154[label="",style="solid", color="burlywood", weight=9];
4154 -> 45[label="",style="solid", color="burlywood", weight=3];
40[label="(++) intersectBy000 (Neg (Succ wv30000) :% wv301) ((||) primEqInt (Neg (Succ wv30000)) wv400 && wv301 == wv401 foldr (||) False (map ((==) Neg (Succ wv30000) :% wv301) wv41)) wv5",fontsize=16,color="burlywood",shape="box"];4155[label="wv400/Pos wv4000",fontsize=10,color="white",style="solid",shape="box"];40 -> 4155[label="",style="solid", color="burlywood", weight=9];
4155 -> 46[label="",style="solid", color="burlywood", weight=3];
4156[label="wv400/Neg wv4000",fontsize=10,color="white",style="solid",shape="box"];40 -> 4156[label="",style="solid", color="burlywood", weight=9];
4156 -> 47[label="",style="solid", color="burlywood", weight=3];
41[label="(++) intersectBy000 (Neg Zero :% wv301) ((||) primEqInt (Neg Zero) wv400 && wv301 == wv401 foldr (||) False (map ((==) Neg Zero :% wv301) wv41)) wv5",fontsize=16,color="burlywood",shape="box"];4157[label="wv400/Pos wv4000",fontsize=10,color="white",style="solid",shape="box"];41 -> 4157[label="",style="solid", color="burlywood", weight=9];
4157 -> 48[label="",style="solid", color="burlywood", weight=3];
4158[label="wv400/Neg wv4000",fontsize=10,color="white",style="solid",shape="box"];41 -> 4158[label="",style="solid", color="burlywood", weight=9];
4158 -> 49[label="",style="solid", color="burlywood", weight=3];
42[label="(++) intersectBy000 (Pos (Succ wv30000) :% wv301) ((||) primEqInt (Pos (Succ wv30000)) (Pos wv4000) && wv301 == wv401 foldr (||) False (map ((==) Pos (Succ wv30000) :% wv301) wv41)) wv5",fontsize=16,color="burlywood",shape="box"];4159[label="wv4000/Succ wv40000",fontsize=10,color="white",style="solid",shape="box"];42 -> 4159[label="",style="solid", color="burlywood", weight=9];
4159 -> 50[label="",style="solid", color="burlywood", weight=3];
4160[label="wv4000/Zero",fontsize=10,color="white",style="solid",shape="box"];42 -> 4160[label="",style="solid", color="burlywood", weight=9];
4160 -> 51[label="",style="solid", color="burlywood", weight=3];
43[label="(++) intersectBy000 (Pos (Succ wv30000) :% wv301) ((||) primEqInt (Pos (Succ wv30000)) (Neg wv4000) && wv301 == wv401 foldr (||) False (map ((==) Pos (Succ wv30000) :% wv301) wv41)) wv5",fontsize=16,color="black",shape="box"];43 -> 52[label="",style="solid", color="black", weight=3];
44[label="(++) intersectBy000 (Pos Zero :% wv301) ((||) primEqInt (Pos Zero) (Pos wv4000) && wv301 == wv401 foldr (||) False (map ((==) Pos Zero :% wv301) wv41)) wv5",fontsize=16,color="burlywood",shape="box"];4161[label="wv4000/Succ wv40000",fontsize=10,color="white",style="solid",shape="box"];44 -> 4161[label="",style="solid", color="burlywood", weight=9];
4161 -> 53[label="",style="solid", color="burlywood", weight=3];
4162[label="wv4000/Zero",fontsize=10,color="white",style="solid",shape="box"];44 -> 4162[label="",style="solid", color="burlywood", weight=9];
4162 -> 54[label="",style="solid", color="burlywood", weight=3];
45[label="(++) intersectBy000 (Pos Zero :% wv301) ((||) primEqInt (Pos Zero) (Neg wv4000) && wv301 == wv401 foldr (||) False (map ((==) Pos Zero :% wv301) wv41)) wv5",fontsize=16,color="burlywood",shape="box"];4163[label="wv4000/Succ wv40000",fontsize=10,color="white",style="solid",shape="box"];45 -> 4163[label="",style="solid", color="burlywood", weight=9];
4163 -> 55[label="",style="solid", color="burlywood", weight=3];
4164[label="wv4000/Zero",fontsize=10,color="white",style="solid",shape="box"];45 -> 4164[label="",style="solid", color="burlywood", weight=9];
4164 -> 56[label="",style="solid", color="burlywood", weight=3];
46[label="(++) intersectBy000 (Neg (Succ wv30000) :% wv301) ((||) primEqInt (Neg (Succ wv30000)) (Pos wv4000) && wv301 == wv401 foldr (||) False (map ((==) Neg (Succ wv30000) :% wv301) wv41)) wv5",fontsize=16,color="black",shape="box"];46 -> 57[label="",style="solid", color="black", weight=3];
47[label="(++) intersectBy000 (Neg (Succ wv30000) :% wv301) ((||) primEqInt (Neg (Succ wv30000)) (Neg wv4000) && wv301 == wv401 foldr (||) False (map ((==) Neg (Succ wv30000) :% wv301) wv41)) wv5",fontsize=16,color="burlywood",shape="box"];4165[label="wv4000/Succ wv40000",fontsize=10,color="white",style="solid",shape="box"];47 -> 4165[label="",style="solid", color="burlywood", weight=9];
4165 -> 58[label="",style="solid", color="burlywood", weight=3];
4166[label="wv4000/Zero",fontsize=10,color="white",style="solid",shape="box"];47 -> 4166[label="",style="solid", color="burlywood", weight=9];
4166 -> 59[label="",style="solid", color="burlywood", weight=3];
48[label="(++) intersectBy000 (Neg Zero :% wv301) ((||) primEqInt (Neg Zero) (Pos wv4000) && wv301 == wv401 foldr (||) False (map ((==) Neg Zero :% wv301) wv41)) wv5",fontsize=16,color="burlywood",shape="box"];4167[label="wv4000/Succ wv40000",fontsize=10,color="white",style="solid",shape="box"];48 -> 4167[label="",style="solid", color="burlywood", weight=9];
4167 -> 60[label="",style="solid", color="burlywood", weight=3];
4168[label="wv4000/Zero",fontsize=10,color="white",style="solid",shape="box"];48 -> 4168[label="",style="solid", color="burlywood", weight=9];
4168 -> 61[label="",style="solid", color="burlywood", weight=3];
49[label="(++) intersectBy000 (Neg Zero :% wv301) ((||) primEqInt (Neg Zero) (Neg wv4000) && wv301 == wv401 foldr (||) False (map ((==) Neg Zero :% wv301) wv41)) wv5",fontsize=16,color="burlywood",shape="box"];4169[label="wv4000/Succ wv40000",fontsize=10,color="white",style="solid",shape="box"];49 -> 4169[label="",style="solid", color="burlywood", weight=9];
4169 -> 62[label="",style="solid", color="burlywood", weight=3];
4170[label="wv4000/Zero",fontsize=10,color="white",style="solid",shape="box"];49 -> 4170[label="",style="solid", color="burlywood", weight=9];
4170 -> 63[label="",style="solid", color="burlywood", weight=3];
50[label="(++) intersectBy000 (Pos (Succ wv30000) :% wv301) ((||) primEqInt (Pos (Succ wv30000)) (Pos (Succ wv40000)) && wv301 == wv401 foldr (||) False (map ((==) Pos (Succ wv30000) :% wv301) wv41)) wv5",fontsize=16,color="black",shape="box"];50 -> 64[label="",style="solid", color="black", weight=3];
51[label="(++) intersectBy000 (Pos (Succ wv30000) :% wv301) ((||) primEqInt (Pos (Succ wv30000)) (Pos Zero) && wv301 == wv401 foldr (||) False (map ((==) Pos (Succ wv30000) :% wv301) wv41)) wv5",fontsize=16,color="black",shape="box"];51 -> 65[label="",style="solid", color="black", weight=3];
52[label="(++) intersectBy000 (Pos (Succ wv30000) :% wv301) ((||) False && wv301 == wv401 foldr (||) False (map ((==) Pos (Succ wv30000) :% wv301) wv41)) wv5",fontsize=16,color="black",shape="triangle"];52 -> 66[label="",style="solid", color="black", weight=3];
53[label="(++) intersectBy000 (Pos Zero :% wv301) ((||) primEqInt (Pos Zero) (Pos (Succ wv40000)) && wv301 == wv401 foldr (||) False (map ((==) Pos Zero :% wv301) wv41)) wv5",fontsize=16,color="black",shape="box"];53 -> 67[label="",style="solid", color="black", weight=3];
54[label="(++) intersectBy000 (Pos Zero :% wv301) ((||) primEqInt (Pos Zero) (Pos Zero) && wv301 == wv401 foldr (||) False (map ((==) Pos Zero :% wv301) wv41)) wv5",fontsize=16,color="black",shape="box"];54 -> 68[label="",style="solid", color="black", weight=3];
55[label="(++) intersectBy000 (Pos Zero :% wv301) ((||) primEqInt (Pos Zero) (Neg (Succ wv40000)) && wv301 == wv401 foldr (||) False (map ((==) Pos Zero :% wv301) wv41)) wv5",fontsize=16,color="black",shape="box"];55 -> 69[label="",style="solid", color="black", weight=3];
56[label="(++) intersectBy000 (Pos Zero :% wv301) ((||) primEqInt (Pos Zero) (Neg Zero) && wv301 == wv401 foldr (||) False (map ((==) Pos Zero :% wv301) wv41)) wv5",fontsize=16,color="black",shape="box"];56 -> 70[label="",style="solid", color="black", weight=3];
57[label="(++) intersectBy000 (Neg (Succ wv30000) :% wv301) ((||) False && wv301 == wv401 foldr (||) False (map ((==) Neg (Succ wv30000) :% wv301) wv41)) wv5",fontsize=16,color="black",shape="triangle"];57 -> 71[label="",style="solid", color="black", weight=3];
58[label="(++) intersectBy000 (Neg (Succ wv30000) :% wv301) ((||) primEqInt (Neg (Succ wv30000)) (Neg (Succ wv40000)) && wv301 == wv401 foldr (||) False (map ((==) Neg (Succ wv30000) :% wv301) wv41)) wv5",fontsize=16,color="black",shape="box"];58 -> 72[label="",style="solid", color="black", weight=3];
59[label="(++) intersectBy000 (Neg (Succ wv30000) :% wv301) ((||) primEqInt (Neg (Succ wv30000)) (Neg Zero) && wv301 == wv401 foldr (||) False (map ((==) Neg (Succ wv30000) :% wv301) wv41)) wv5",fontsize=16,color="black",shape="box"];59 -> 73[label="",style="solid", color="black", weight=3];
60[label="(++) intersectBy000 (Neg Zero :% wv301) ((||) primEqInt (Neg Zero) (Pos (Succ wv40000)) && wv301 == wv401 foldr (||) False (map ((==) Neg Zero :% wv301) wv41)) wv5",fontsize=16,color="black",shape="box"];60 -> 74[label="",style="solid", color="black", weight=3];
61[label="(++) intersectBy000 (Neg Zero :% wv301) ((||) primEqInt (Neg Zero) (Pos Zero) && wv301 == wv401 foldr (||) False (map ((==) Neg Zero :% wv301) wv41)) wv5",fontsize=16,color="black",shape="box"];61 -> 75[label="",style="solid", color="black", weight=3];
62[label="(++) intersectBy000 (Neg Zero :% wv301) ((||) primEqInt (Neg Zero) (Neg (Succ wv40000)) && wv301 == wv401 foldr (||) False (map ((==) Neg Zero :% wv301) wv41)) wv5",fontsize=16,color="black",shape="box"];62 -> 76[label="",style="solid", color="black", weight=3];
63[label="(++) intersectBy000 (Neg Zero :% wv301) ((||) primEqInt (Neg Zero) (Neg Zero) && wv301 == wv401 foldr (||) False (map ((==) Neg Zero :% wv301) wv41)) wv5",fontsize=16,color="black",shape="box"];63 -> 77[label="",style="solid", color="black", weight=3];
64 -> 2288[label="",style="dashed", color="red", weight=0];
64[label="(++) intersectBy000 (Pos (Succ wv30000) :% wv301) ((||) primEqNat wv30000 wv40000 && wv301 == wv401 foldr (||) False (map ((==) Pos (Succ wv30000) :% wv301) wv41)) wv5",fontsize=16,color="magenta"];64 -> 2289[label="",style="dashed", color="magenta", weight=3];
64 -> 2290[label="",style="dashed", color="magenta", weight=3];
64 -> 2291[label="",style="dashed", color="magenta", weight=3];
64 -> 2292[label="",style="dashed", color="magenta", weight=3];
64 -> 2293[label="",style="dashed", color="magenta", weight=3];
64 -> 2294[label="",style="dashed", color="magenta", weight=3];
64 -> 2295[label="",style="dashed", color="magenta", weight=3];
65 -> 52[label="",style="dashed", color="red", weight=0];
65[label="(++) intersectBy000 (Pos (Succ wv30000) :% wv301) ((||) False && wv301 == wv401 foldr (||) False (map ((==) Pos (Succ wv30000) :% wv301) wv41)) wv5",fontsize=16,color="magenta"];66[label="(++) intersectBy000 (Pos (Succ wv30000) :% wv301) ((||) False foldr (||) False (map ((==) Pos (Succ wv30000) :% wv301) wv41)) wv5",fontsize=16,color="black",shape="triangle"];66 -> 80[label="",style="solid", color="black", weight=3];
67[label="(++) intersectBy000 (Pos Zero :% wv301) ((||) False && wv301 == wv401 foldr (||) False (map ((==) Pos Zero :% wv301) wv41)) wv5",fontsize=16,color="black",shape="triangle"];67 -> 81[label="",style="solid", color="black", weight=3];
68[label="(++) intersectBy000 (Pos Zero :% wv301) ((||) True && wv301 == wv401 foldr (||) False (map ((==) Pos Zero :% wv301) wv41)) wv5",fontsize=16,color="black",shape="triangle"];68 -> 82[label="",style="solid", color="black", weight=3];
69 -> 67[label="",style="dashed", color="red", weight=0];
69[label="(++) intersectBy000 (Pos Zero :% wv301) ((||) False && wv301 == wv401 foldr (||) False (map ((==) Pos Zero :% wv301) wv41)) wv5",fontsize=16,color="magenta"];70 -> 68[label="",style="dashed", color="red", weight=0];
70[label="(++) intersectBy000 (Pos Zero :% wv301) ((||) True && wv301 == wv401 foldr (||) False (map ((==) Pos Zero :% wv301) wv41)) wv5",fontsize=16,color="magenta"];71[label="(++) intersectBy000 (Neg (Succ wv30000) :% wv301) ((||) False foldr (||) False (map ((==) Neg (Succ wv30000) :% wv301) wv41)) wv5",fontsize=16,color="black",shape="triangle"];71 -> 83[label="",style="solid", color="black", weight=3];
72 -> 2364[label="",style="dashed", color="red", weight=0];
72[label="(++) intersectBy000 (Neg (Succ wv30000) :% wv301) ((||) primEqNat wv30000 wv40000 && wv301 == wv401 foldr (||) False (map ((==) Neg (Succ wv30000) :% wv301) wv41)) wv5",fontsize=16,color="magenta"];72 -> 2365[label="",style="dashed", color="magenta", weight=3];
72 -> 2366[label="",style="dashed", color="magenta", weight=3];
72 -> 2367[label="",style="dashed", color="magenta", weight=3];
72 -> 2368[label="",style="dashed", color="magenta", weight=3];
72 -> 2369[label="",style="dashed", color="magenta", weight=3];
72 -> 2370[label="",style="dashed", color="magenta", weight=3];
72 -> 2371[label="",style="dashed", color="magenta", weight=3];
73 -> 57[label="",style="dashed", color="red", weight=0];
73[label="(++) intersectBy000 (Neg (Succ wv30000) :% wv301) ((||) False && wv301 == wv401 foldr (||) False (map ((==) Neg (Succ wv30000) :% wv301) wv41)) wv5",fontsize=16,color="magenta"];74[label="(++) intersectBy000 (Neg Zero :% wv301) ((||) False && wv301 == wv401 foldr (||) False (map ((==) Neg Zero :% wv301) wv41)) wv5",fontsize=16,color="black",shape="triangle"];74 -> 86[label="",style="solid", color="black", weight=3];
75[label="(++) intersectBy000 (Neg Zero :% wv301) ((||) True && wv301 == wv401 foldr (||) False (map ((==) Neg Zero :% wv301) wv41)) wv5",fontsize=16,color="black",shape="triangle"];75 -> 87[label="",style="solid", color="black", weight=3];
76 -> 74[label="",style="dashed", color="red", weight=0];
76[label="(++) intersectBy000 (Neg Zero :% wv301) ((||) False && wv301 == wv401 foldr (||) False (map ((==) Neg Zero :% wv301) wv41)) wv5",fontsize=16,color="magenta"];77 -> 75[label="",style="dashed", color="red", weight=0];
77[label="(++) intersectBy000 (Neg Zero :% wv301) ((||) True && wv301 == wv401 foldr (||) False (map ((==) Neg Zero :% wv301) wv41)) wv5",fontsize=16,color="magenta"];2289[label="wv30000",fontsize=16,color="green",shape="box"];2290[label="wv301",fontsize=16,color="green",shape="box"];2291[label="wv401",fontsize=16,color="green",shape="box"];2292[label="wv30000",fontsize=16,color="green",shape="box"];2293[label="wv40000",fontsize=16,color="green",shape="box"];2294[label="wv5",fontsize=16,color="green",shape="box"];2295[label="wv41",fontsize=16,color="green",shape="box"];2288[label="(++) intersectBy000 (Pos (Succ wv16) :% wv17) ((||) primEqNat wv18 wv19 && wv17 == wv20 foldr (||) False (map ((==) Pos (Succ wv16) :% wv17) wv21)) wv22",fontsize=16,color="burlywood",shape="triangle"];4179[label="wv18/Succ wv180",fontsize=10,color="white",style="solid",shape="box"];2288 -> 4179[label="",style="solid", color="burlywood", weight=9];
4179 -> 2352[label="",style="solid", color="burlywood", weight=3];
4180[label="wv18/Zero",fontsize=10,color="white",style="solid",shape="box"];2288 -> 4180[label="",style="solid", color="burlywood", weight=9];
4180 -> 2353[label="",style="solid", color="burlywood", weight=3];
80 -> 23[label="",style="dashed", color="red", weight=0];
80[label="(++) intersectBy000 (Pos (Succ wv30000) :% wv301) (foldr (||) False (map ((==) Pos (Succ wv30000) :% wv301) wv41)) wv5",fontsize=16,color="magenta"];80 -> 92[label="",style="dashed", color="magenta", weight=3];
80 -> 93[label="",style="dashed", color="magenta", weight=3];
81[label="(++) intersectBy000 (Pos Zero :% wv301) ((||) False foldr (||) False (map ((==) Pos Zero :% wv301) wv41)) wv5",fontsize=16,color="black",shape="triangle"];81 -> 94[label="",style="solid", color="black", weight=3];
82[label="(++) intersectBy000 (Pos Zero :% wv301) ((||) wv301 == wv401 foldr (||) False (map ((==) Pos Zero :% wv301) wv41)) wv5",fontsize=16,color="black",shape="box"];82 -> 95[label="",style="solid", color="black", weight=3];
83 -> 23[label="",style="dashed", color="red", weight=0];
83[label="(++) intersectBy000 (Neg (Succ wv30000) :% wv301) (foldr (||) False (map ((==) Neg (Succ wv30000) :% wv301) wv41)) wv5",fontsize=16,color="magenta"];83 -> 96[label="",style="dashed", color="magenta", weight=3];
83 -> 97[label="",style="dashed", color="magenta", weight=3];
2365[label="wv30000",fontsize=16,color="green",shape="box"];2366[label="wv5",fontsize=16,color="green",shape="box"];2367[label="wv40000",fontsize=16,color="green",shape="box"];2368[label="wv30000",fontsize=16,color="green",shape="box"];2369[label="wv301",fontsize=16,color="green",shape="box"];2370[label="wv401",fontsize=16,color="green",shape="box"];2371[label="wv41",fontsize=16,color="green",shape="box"];2364[label="(++) intersectBy000 (Neg (Succ wv24) :% wv25) ((||) primEqNat wv26 wv27 && wv25 == wv28 foldr (||) False (map ((==) Neg (Succ wv24) :% wv25) wv29)) wv30",fontsize=16,color="burlywood",shape="triangle"];4183[label="wv26/Succ wv260",fontsize=10,color="white",style="solid",shape="box"];2364 -> 4183[label="",style="solid", color="burlywood", weight=9];
4183 -> 2428[label="",style="solid", color="burlywood", weight=3];
4184[label="wv26/Zero",fontsize=10,color="white",style="solid",shape="box"];2364 -> 4184[label="",style="solid", color="burlywood", weight=9];
4184 -> 2429[label="",style="solid", color="burlywood", weight=3];
86[label="(++) intersectBy000 (Neg Zero :% wv301) ((||) False foldr (||) False (map ((==) Neg Zero :% wv301) wv41)) wv5",fontsize=16,color="black",shape="triangle"];86 -> 102[label="",style="solid", color="black", weight=3];
87[label="(++) intersectBy000 (Neg Zero :% wv301) ((||) wv301 == wv401 foldr (||) False (map ((==) Neg Zero :% wv301) wv41)) wv5",fontsize=16,color="black",shape="box"];87 -> 103[label="",style="solid", color="black", weight=3];
2352[label="(++) intersectBy000 (Pos (Succ wv16) :% wv17) ((||) primEqNat (Succ wv180) wv19 && wv17 == wv20 foldr (||) False (map ((==) Pos (Succ wv16) :% wv17) wv21)) wv22",fontsize=16,color="burlywood",shape="box"];4185[label="wv19/Succ wv190",fontsize=10,color="white",style="solid",shape="box"];2352 -> 4185[label="",style="solid", color="burlywood", weight=9];
4185 -> 2430[label="",style="solid", color="burlywood", weight=3];
4186[label="wv19/Zero",fontsize=10,color="white",style="solid",shape="box"];2352 -> 4186[label="",style="solid", color="burlywood", weight=9];
4186 -> 2431[label="",style="solid", color="burlywood", weight=3];
2353[label="(++) intersectBy000 (Pos (Succ wv16) :% wv17) ((||) primEqNat Zero wv19 && wv17 == wv20 foldr (||) False (map ((==) Pos (Succ wv16) :% wv17) wv21)) wv22",fontsize=16,color="burlywood",shape="box"];4187[label="wv19/Succ wv190",fontsize=10,color="white",style="solid",shape="box"];2353 -> 4187[label="",style="solid", color="burlywood", weight=9];
4187 -> 2432[label="",style="solid", color="burlywood", weight=3];
4188[label="wv19/Zero",fontsize=10,color="white",style="solid",shape="box"];2353 -> 4188[label="",style="solid", color="burlywood", weight=9];
4188 -> 2433[label="",style="solid", color="burlywood", weight=3];
92[label="wv41",fontsize=16,color="green",shape="box"];93[label="Pos (Succ wv30000) :% wv301",fontsize=16,color="green",shape="box"];94 -> 23[label="",style="dashed", color="red", weight=0];
94[label="(++) intersectBy000 (Pos Zero :% wv301) (foldr (||) False (map ((==) Pos Zero :% wv301) wv41)) wv5",fontsize=16,color="magenta"];94 -> 108[label="",style="dashed", color="magenta", weight=3];
94 -> 109[label="",style="dashed", color="magenta", weight=3];
95[label="(++) intersectBy000 (Pos Zero :% wv301) ((||) primEqInt wv301 wv401 foldr (||) False (map ((==) Pos Zero :% wv301) wv41)) wv5",fontsize=16,color="burlywood",shape="box"];4190[label="wv301/Pos wv3010",fontsize=10,color="white",style="solid",shape="box"];95 -> 4190[label="",style="solid", color="burlywood", weight=9];
4190 -> 110[label="",style="solid", color="burlywood", weight=3];
4191[label="wv301/Neg wv3010",fontsize=10,color="white",style="solid",shape="box"];95 -> 4191[label="",style="solid", color="burlywood", weight=9];
4191 -> 111[label="",style="solid", color="burlywood", weight=3];
96[label="wv41",fontsize=16,color="green",shape="box"];97[label="Neg (Succ wv30000) :% wv301",fontsize=16,color="green",shape="box"];2428[label="(++) intersectBy000 (Neg (Succ wv24) :% wv25) ((||) primEqNat (Succ wv260) wv27 && wv25 == wv28 foldr (||) False (map ((==) Neg (Succ wv24) :% wv25) wv29)) wv30",fontsize=16,color="burlywood",shape="box"];4192[label="wv27/Succ wv270",fontsize=10,color="white",style="solid",shape="box"];2428 -> 4192[label="",style="solid", color="burlywood", weight=9];
4192 -> 2456[label="",style="solid", color="burlywood", weight=3];
4193[label="wv27/Zero",fontsize=10,color="white",style="solid",shape="box"];2428 -> 4193[label="",style="solid", color="burlywood", weight=9];
4193 -> 2457[label="",style="solid", color="burlywood", weight=3];
2429[label="(++) intersectBy000 (Neg (Succ wv24) :% wv25) ((||) primEqNat Zero wv27 && wv25 == wv28 foldr (||) False (map ((==) Neg (Succ wv24) :% wv25) wv29)) wv30",fontsize=16,color="burlywood",shape="box"];4194[label="wv27/Succ wv270",fontsize=10,color="white",style="solid",shape="box"];2429 -> 4194[label="",style="solid", color="burlywood", weight=9];
4194 -> 2458[label="",style="solid", color="burlywood", weight=3];
4195[label="wv27/Zero",fontsize=10,color="white",style="solid",shape="box"];2429 -> 4195[label="",style="solid", color="burlywood", weight=9];
4195 -> 2459[label="",style="solid", color="burlywood", weight=3];
102 -> 23[label="",style="dashed", color="red", weight=0];
102[label="(++) intersectBy000 (Neg Zero :% wv301) (foldr (||) False (map ((==) Neg Zero :% wv301) wv41)) wv5",fontsize=16,color="magenta"];102 -> 116[label="",style="dashed", color="magenta", weight=3];
102 -> 117[label="",style="dashed", color="magenta", weight=3];
103[label="(++) intersectBy000 (Neg Zero :% wv301) ((||) primEqInt wv301 wv401 foldr (||) False (map ((==) Neg Zero :% wv301) wv41)) wv5",fontsize=16,color="burlywood",shape="box"];4197[label="wv301/Pos wv3010",fontsize=10,color="white",style="solid",shape="box"];103 -> 4197[label="",style="solid", color="burlywood", weight=9];
4197 -> 118[label="",style="solid", color="burlywood", weight=3];
4198[label="wv301/Neg wv3010",fontsize=10,color="white",style="solid",shape="box"];103 -> 4198[label="",style="solid", color="burlywood", weight=9];
4198 -> 119[label="",style="solid", color="burlywood", weight=3];
2430[label="(++) intersectBy000 (Pos (Succ wv16) :% wv17) ((||) primEqNat (Succ wv180) (Succ wv190) && wv17 == wv20 foldr (||) False (map ((==) Pos (Succ wv16) :% wv17) wv21)) wv22",fontsize=16,color="black",shape="box"];2430 -> 2460[label="",style="solid", color="black", weight=3];
2431[label="(++) intersectBy000 (Pos (Succ wv16) :% wv17) ((||) primEqNat (Succ wv180) Zero && wv17 == wv20 foldr (||) False (map ((==) Pos (Succ wv16) :% wv17) wv21)) wv22",fontsize=16,color="black",shape="box"];2431 -> 2461[label="",style="solid", color="black", weight=3];
2432[label="(++) intersectBy000 (Pos (Succ wv16) :% wv17) ((||) primEqNat Zero (Succ wv190) && wv17 == wv20 foldr (||) False (map ((==) Pos (Succ wv16) :% wv17) wv21)) wv22",fontsize=16,color="black",shape="box"];2432 -> 2462[label="",style="solid", color="black", weight=3];
2433[label="(++) intersectBy000 (Pos (Succ wv16) :% wv17) ((||) primEqNat Zero Zero && wv17 == wv20 foldr (||) False (map ((==) Pos (Succ wv16) :% wv17) wv21)) wv22",fontsize=16,color="black",shape="box"];2433 -> 2463[label="",style="solid", color="black", weight=3];
108[label="wv41",fontsize=16,color="green",shape="box"];109[label="Pos Zero :% wv301",fontsize=16,color="green",shape="box"];110[label="(++) intersectBy000 (Pos Zero :% Pos wv3010) ((||) primEqInt (Pos wv3010) wv401 foldr (||) False (map ((==) Pos Zero :% Pos wv3010) wv41)) wv5",fontsize=16,color="burlywood",shape="box"];4199[label="wv3010/Succ wv30100",fontsize=10,color="white",style="solid",shape="box"];110 -> 4199[label="",style="solid", color="burlywood", weight=9];
4199 -> 125[label="",style="solid", color="burlywood", weight=3];
4200[label="wv3010/Zero",fontsize=10,color="white",style="solid",shape="box"];110 -> 4200[label="",style="solid", color="burlywood", weight=9];
4200 -> 126[label="",style="solid", color="burlywood", weight=3];
111[label="(++) intersectBy000 (Pos Zero :% Neg wv3010) ((||) primEqInt (Neg wv3010) wv401 foldr (||) False (map ((==) Pos Zero :% Neg wv3010) wv41)) wv5",fontsize=16,color="burlywood",shape="box"];4201[label="wv3010/Succ wv30100",fontsize=10,color="white",style="solid",shape="box"];111 -> 4201[label="",style="solid", color="burlywood", weight=9];
4201 -> 127[label="",style="solid", color="burlywood", weight=3];
4202[label="wv3010/Zero",fontsize=10,color="white",style="solid",shape="box"];111 -> 4202[label="",style="solid", color="burlywood", weight=9];
4202 -> 128[label="",style="solid", color="burlywood", weight=3];
2456[label="(++) intersectBy000 (Neg (Succ wv24) :% wv25) ((||) primEqNat (Succ wv260) (Succ wv270) && wv25 == wv28 foldr (||) False (map ((==) Neg (Succ wv24) :% wv25) wv29)) wv30",fontsize=16,color="black",shape="box"];2456 -> 2486[label="",style="solid", color="black", weight=3];
2457[label="(++) intersectBy000 (Neg (Succ wv24) :% wv25) ((||) primEqNat (Succ wv260) Zero && wv25 == wv28 foldr (||) False (map ((==) Neg (Succ wv24) :% wv25) wv29)) wv30",fontsize=16,color="black",shape="box"];2457 -> 2487[label="",style="solid", color="black", weight=3];
2458[label="(++) intersectBy000 (Neg (Succ wv24) :% wv25) ((||) primEqNat Zero (Succ wv270) && wv25 == wv28 foldr (||) False (map ((==) Neg (Succ wv24) :% wv25) wv29)) wv30",fontsize=16,color="black",shape="box"];2458 -> 2488[label="",style="solid", color="black", weight=3];
2459[label="(++) intersectBy000 (Neg (Succ wv24) :% wv25) ((||) primEqNat Zero Zero && wv25 == wv28 foldr (||) False (map ((==) Neg (Succ wv24) :% wv25) wv29)) wv30",fontsize=16,color="black",shape="box"];2459 -> 2489[label="",style="solid", color="black", weight=3];
116[label="wv41",fontsize=16,color="green",shape="box"];117[label="Neg Zero :% wv301",fontsize=16,color="green",shape="box"];118[label="(++) intersectBy000 (Neg Zero :% Pos wv3010) ((||) primEqInt (Pos wv3010) wv401 foldr (||) False (map ((==) Neg Zero :% Pos wv3010) wv41)) wv5",fontsize=16,color="burlywood",shape="box"];4203[label="wv3010/Succ wv30100",fontsize=10,color="white",style="solid",shape="box"];118 -> 4203[label="",style="solid", color="burlywood", weight=9];
4203 -> 134[label="",style="solid", color="burlywood", weight=3];
4204[label="wv3010/Zero",fontsize=10,color="white",style="solid",shape="box"];118 -> 4204[label="",style="solid", color="burlywood", weight=9];
4204 -> 135[label="",style="solid", color="burlywood", weight=3];
119[label="(++) intersectBy000 (Neg Zero :% Neg wv3010) ((||) primEqInt (Neg wv3010) wv401 foldr (||) False (map ((==) Neg Zero :% Neg wv3010) wv41)) wv5",fontsize=16,color="burlywood",shape="box"];4205[label="wv3010/Succ wv30100",fontsize=10,color="white",style="solid",shape="box"];119 -> 4205[label="",style="solid", color="burlywood", weight=9];
4205 -> 136[label="",style="solid", color="burlywood", weight=3];
4206[label="wv3010/Zero",fontsize=10,color="white",style="solid",shape="box"];119 -> 4206[label="",style="solid", color="burlywood", weight=9];
4206 -> 137[label="",style="solid", color="burlywood", weight=3];
2460 -> 2288[label="",style="dashed", color="red", weight=0];
2460[label="(++) intersectBy000 (Pos (Succ wv16) :% wv17) ((||) primEqNat wv180 wv190 && wv17 == wv20 foldr (||) False (map ((==) Pos (Succ wv16) :% wv17) wv21)) wv22",fontsize=16,color="magenta"];2460 -> 2490[label="",style="dashed", color="magenta", weight=3];
2460 -> 2491[label="",style="dashed", color="magenta", weight=3];
2461 -> 52[label="",style="dashed", color="red", weight=0];
2461[label="(++) intersectBy000 (Pos (Succ wv16) :% wv17) ((||) False && wv17 == wv20 foldr (||) False (map ((==) Pos (Succ wv16) :% wv17) wv21)) wv22",fontsize=16,color="magenta"];2461 -> 2492[label="",style="dashed", color="magenta", weight=3];
2461 -> 2493[label="",style="dashed", color="magenta", weight=3];
2461 -> 2494[label="",style="dashed", color="magenta", weight=3];
2461 -> 2495[label="",style="dashed", color="magenta", weight=3];
2461 -> 2496[label="",style="dashed", color="magenta", weight=3];
2462 -> 52[label="",style="dashed", color="red", weight=0];
2462[label="(++) intersectBy000 (Pos (Succ wv16) :% wv17) ((||) False && wv17 == wv20 foldr (||) False (map ((==) Pos (Succ wv16) :% wv17) wv21)) wv22",fontsize=16,color="magenta"];2462 -> 2497[label="",style="dashed", color="magenta", weight=3];
2462 -> 2498[label="",style="dashed", color="magenta", weight=3];
2462 -> 2499[label="",style="dashed", color="magenta", weight=3];
2462 -> 2500[label="",style="dashed", color="magenta", weight=3];
2462 -> 2501[label="",style="dashed", color="magenta", weight=3];
2463[label="(++) intersectBy000 (Pos (Succ wv16) :% wv17) ((||) True && wv17 == wv20 foldr (||) False (map ((==) Pos (Succ wv16) :% wv17) wv21)) wv22",fontsize=16,color="black",shape="box"];2463 -> 2502[label="",style="solid", color="black", weight=3];
125[label="(++) intersectBy000 (Pos Zero :% Pos (Succ wv30100)) ((||) primEqInt (Pos (Succ wv30100)) wv401 foldr (||) False (map ((==) Pos Zero :% Pos (Succ wv30100)) wv41)) wv5",fontsize=16,color="burlywood",shape="box"];4210[label="wv401/Pos wv4010",fontsize=10,color="white",style="solid",shape="box"];125 -> 4210[label="",style="solid", color="burlywood", weight=9];
4210 -> 143[label="",style="solid", color="burlywood", weight=3];
4211[label="wv401/Neg wv4010",fontsize=10,color="white",style="solid",shape="box"];125 -> 4211[label="",style="solid", color="burlywood", weight=9];
4211 -> 144[label="",style="solid", color="burlywood", weight=3];
126[label="(++) intersectBy000 (Pos Zero :% Pos Zero) ((||) primEqInt (Pos Zero) wv401 foldr (||) False (map ((==) Pos Zero :% Pos Zero) wv41)) wv5",fontsize=16,color="burlywood",shape="box"];4212[label="wv401/Pos wv4010",fontsize=10,color="white",style="solid",shape="box"];126 -> 4212[label="",style="solid", color="burlywood", weight=9];
4212 -> 145[label="",style="solid", color="burlywood", weight=3];
4213[label="wv401/Neg wv4010",fontsize=10,color="white",style="solid",shape="box"];126 -> 4213[label="",style="solid", color="burlywood", weight=9];
4213 -> 146[label="",style="solid", color="burlywood", weight=3];
127[label="(++) intersectBy000 (Pos Zero :% Neg (Succ wv30100)) ((||) primEqInt (Neg (Succ wv30100)) wv401 foldr (||) False (map ((==) Pos Zero :% Neg (Succ wv30100)) wv41)) wv5",fontsize=16,color="burlywood",shape="box"];4214[label="wv401/Pos wv4010",fontsize=10,color="white",style="solid",shape="box"];127 -> 4214[label="",style="solid", color="burlywood", weight=9];
4214 -> 147[label="",style="solid", color="burlywood", weight=3];
4215[label="wv401/Neg wv4010",fontsize=10,color="white",style="solid",shape="box"];127 -> 4215[label="",style="solid", color="burlywood", weight=9];
4215 -> 148[label="",style="solid", color="burlywood", weight=3];
128[label="(++) intersectBy000 (Pos Zero :% Neg Zero) ((||) primEqInt (Neg Zero) wv401 foldr (||) False (map ((==) Pos Zero :% Neg Zero) wv41)) wv5",fontsize=16,color="burlywood",shape="box"];4216[label="wv401/Pos wv4010",fontsize=10,color="white",style="solid",shape="box"];128 -> 4216[label="",style="solid", color="burlywood", weight=9];
4216 -> 149[label="",style="solid", color="burlywood", weight=3];
4217[label="wv401/Neg wv4010",fontsize=10,color="white",style="solid",shape="box"];128 -> 4217[label="",style="solid", color="burlywood", weight=9];
4217 -> 150[label="",style="solid", color="burlywood", weight=3];
2486 -> 2364[label="",style="dashed", color="red", weight=0];
2486[label="(++) intersectBy000 (Neg (Succ wv24) :% wv25) ((||) primEqNat wv260 wv270 && wv25 == wv28 foldr (||) False (map ((==) Neg (Succ wv24) :% wv25) wv29)) wv30",fontsize=16,color="magenta"];2486 -> 2523[label="",style="dashed", color="magenta", weight=3];
2486 -> 2524[label="",style="dashed", color="magenta", weight=3];
2487 -> 57[label="",style="dashed", color="red", weight=0];
2487[label="(++) intersectBy000 (Neg (Succ wv24) :% wv25) ((||) False && wv25 == wv28 foldr (||) False (map ((==) Neg (Succ wv24) :% wv25) wv29)) wv30",fontsize=16,color="magenta"];2487 -> 2525[label="",style="dashed", color="magenta", weight=3];
2487 -> 2526[label="",style="dashed", color="magenta", weight=3];
2487 -> 2527[label="",style="dashed", color="magenta", weight=3];
2487 -> 2528[label="",style="dashed", color="magenta", weight=3];
2487 -> 2529[label="",style="dashed", color="magenta", weight=3];
2488 -> 57[label="",style="dashed", color="red", weight=0];
2488[label="(++) intersectBy000 (Neg (Succ wv24) :% wv25) ((||) False && wv25 == wv28 foldr (||) False (map ((==) Neg (Succ wv24) :% wv25) wv29)) wv30",fontsize=16,color="magenta"];2488 -> 2530[label="",style="dashed", color="magenta", weight=3];
2488 -> 2531[label="",style="dashed", color="magenta", weight=3];
2488 -> 2532[label="",style="dashed", color="magenta", weight=3];
2488 -> 2533[label="",style="dashed", color="magenta", weight=3];
2488 -> 2534[label="",style="dashed", color="magenta", weight=3];
2489[label="(++) intersectBy000 (Neg (Succ wv24) :% wv25) ((||) True && wv25 == wv28 foldr (||) False (map ((==) Neg (Succ wv24) :% wv25) wv29)) wv30",fontsize=16,color="black",shape="box"];2489 -> 2535[label="",style="solid", color="black", weight=3];
134[label="(++) intersectBy000 (Neg Zero :% Pos (Succ wv30100)) ((||) primEqInt (Pos (Succ wv30100)) wv401 foldr (||) False (map ((==) Neg Zero :% Pos (Succ wv30100)) wv41)) wv5",fontsize=16,color="burlywood",shape="box"];4221[label="wv401/Pos wv4010",fontsize=10,color="white",style="solid",shape="box"];134 -> 4221[label="",style="solid", color="burlywood", weight=9];
4221 -> 156[label="",style="solid", color="burlywood", weight=3];
4222[label="wv401/Neg wv4010",fontsize=10,color="white",style="solid",shape="box"];134 -> 4222[label="",style="solid", color="burlywood", weight=9];
4222 -> 157[label="",style="solid", color="burlywood", weight=3];
135[label="(++) intersectBy000 (Neg Zero :% Pos Zero) ((||) primEqInt (Pos Zero) wv401 foldr (||) False (map ((==) Neg Zero :% Pos Zero) wv41)) wv5",fontsize=16,color="burlywood",shape="box"];4223[label="wv401/Pos wv4010",fontsize=10,color="white",style="solid",shape="box"];135 -> 4223[label="",style="solid", color="burlywood", weight=9];
4223 -> 158[label="",style="solid", color="burlywood", weight=3];
4224[label="wv401/Neg wv4010",fontsize=10,color="white",style="solid",shape="box"];135 -> 4224[label="",style="solid", color="burlywood", weight=9];
4224 -> 159[label="",style="solid", color="burlywood", weight=3];
136[label="(++) intersectBy000 (Neg Zero :% Neg (Succ wv30100)) ((||) primEqInt (Neg (Succ wv30100)) wv401 foldr (||) False (map ((==) Neg Zero :% Neg (Succ wv30100)) wv41)) wv5",fontsize=16,color="burlywood",shape="box"];4225[label="wv401/Pos wv4010",fontsize=10,color="white",style="solid",shape="box"];136 -> 4225[label="",style="solid", color="burlywood", weight=9];
4225 -> 160[label="",style="solid", color="burlywood", weight=3];
4226[label="wv401/Neg wv4010",fontsize=10,color="white",style="solid",shape="box"];136 -> 4226[label="",style="solid", color="burlywood", weight=9];
4226 -> 161[label="",style="solid", color="burlywood", weight=3];
137[label="(++) intersectBy000 (Neg Zero :% Neg Zero) ((||) primEqInt (Neg Zero) wv401 foldr (||) False (map ((==) Neg Zero :% Neg Zero) wv41)) wv5",fontsize=16,color="burlywood",shape="box"];4227[label="wv401/Pos wv4010",fontsize=10,color="white",style="solid",shape="box"];137 -> 4227[label="",style="solid", color="burlywood", weight=9];
4227 -> 162[label="",style="solid", color="burlywood", weight=3];
4228[label="wv401/Neg wv4010",fontsize=10,color="white",style="solid",shape="box"];137 -> 4228[label="",style="solid", color="burlywood", weight=9];
4228 -> 163[label="",style="solid", color="burlywood", weight=3];
2490[label="wv180",fontsize=16,color="green",shape="box"];2491[label="wv190",fontsize=16,color="green",shape="box"];2492[label="wv16",fontsize=16,color="green",shape="box"];2493[label="wv17",fontsize=16,color="green",shape="box"];2494[label="wv20",fontsize=16,color="green",shape="box"];2495[label="wv21",fontsize=16,color="green",shape="box"];2496[label="wv22",fontsize=16,color="green",shape="box"];2497[label="wv16",fontsize=16,color="green",shape="box"];2498[label="wv17",fontsize=16,color="green",shape="box"];2499[label="wv20",fontsize=16,color="green",shape="box"];2500[label="wv21",fontsize=16,color="green",shape="box"];2501[label="wv22",fontsize=16,color="green",shape="box"];2502[label="(++) intersectBy000 (Pos (Succ wv16) :% wv17) ((||) wv17 == wv20 foldr (||) False (map ((==) Pos (Succ wv16) :% wv17) wv21)) wv22",fontsize=16,color="black",shape="box"];2502 -> 2536[label="",style="solid", color="black", weight=3];
143[label="(++) intersectBy000 (Pos Zero :% Pos (Succ wv30100)) ((||) primEqInt (Pos (Succ wv30100)) (Pos wv4010) foldr (||) False (map ((==) Pos Zero :% Pos (Succ wv30100)) wv41)) wv5",fontsize=16,color="burlywood",shape="box"];4229[label="wv4010/Succ wv40100",fontsize=10,color="white",style="solid",shape="box"];143 -> 4229[label="",style="solid", color="burlywood", weight=9];
4229 -> 170[label="",style="solid", color="burlywood", weight=3];
4230[label="wv4010/Zero",fontsize=10,color="white",style="solid",shape="box"];143 -> 4230[label="",style="solid", color="burlywood", weight=9];
4230 -> 171[label="",style="solid", color="burlywood", weight=3];
144[label="(++) intersectBy000 (Pos Zero :% Pos (Succ wv30100)) ((||) primEqInt (Pos (Succ wv30100)) (Neg wv4010) foldr (||) False (map ((==) Pos Zero :% Pos (Succ wv30100)) wv41)) wv5",fontsize=16,color="black",shape="box"];144 -> 172[label="",style="solid", color="black", weight=3];
145[label="(++) intersectBy000 (Pos Zero :% Pos Zero) ((||) primEqInt (Pos Zero) (Pos wv4010) foldr (||) False (map ((==) Pos Zero :% Pos Zero) wv41)) wv5",fontsize=16,color="burlywood",shape="box"];4231[label="wv4010/Succ wv40100",fontsize=10,color="white",style="solid",shape="box"];145 -> 4231[label="",style="solid", color="burlywood", weight=9];
4231 -> 173[label="",style="solid", color="burlywood", weight=3];
4232[label="wv4010/Zero",fontsize=10,color="white",style="solid",shape="box"];145 -> 4232[label="",style="solid", color="burlywood", weight=9];
4232 -> 174[label="",style="solid", color="burlywood", weight=3];
146[label="(++) intersectBy000 (Pos Zero :% Pos Zero) ((||) primEqInt (Pos Zero) (Neg wv4010) foldr (||) False (map ((==) Pos Zero :% Pos Zero) wv41)) wv5",fontsize=16,color="burlywood",shape="box"];4233[label="wv4010/Succ wv40100",fontsize=10,color="white",style="solid",shape="box"];146 -> 4233[label="",style="solid", color="burlywood", weight=9];
4233 -> 175[label="",style="solid", color="burlywood", weight=3];
4234[label="wv4010/Zero",fontsize=10,color="white",style="solid",shape="box"];146 -> 4234[label="",style="solid", color="burlywood", weight=9];
4234 -> 176[label="",style="solid", color="burlywood", weight=3];
147[label="(++) intersectBy000 (Pos Zero :% Neg (Succ wv30100)) ((||) primEqInt (Neg (Succ wv30100)) (Pos wv4010) foldr (||) False (map ((==) Pos Zero :% Neg (Succ wv30100)) wv41)) wv5",fontsize=16,color="black",shape="box"];147 -> 177[label="",style="solid", color="black", weight=3];
148[label="(++) intersectBy000 (Pos Zero :% Neg (Succ wv30100)) ((||) primEqInt (Neg (Succ wv30100)) (Neg wv4010) foldr (||) False (map ((==) Pos Zero :% Neg (Succ wv30100)) wv41)) wv5",fontsize=16,color="burlywood",shape="box"];4235[label="wv4010/Succ wv40100",fontsize=10,color="white",style="solid",shape="box"];148 -> 4235[label="",style="solid", color="burlywood", weight=9];
4235 -> 178[label="",style="solid", color="burlywood", weight=3];
4236[label="wv4010/Zero",fontsize=10,color="white",style="solid",shape="box"];148 -> 4236[label="",style="solid", color="burlywood", weight=9];
4236 -> 179[label="",style="solid", color="burlywood", weight=3];
149[label="(++) intersectBy000 (Pos Zero :% Neg Zero) ((||) primEqInt (Neg Zero) (Pos wv4010) foldr (||) False (map ((==) Pos Zero :% Neg Zero) wv41)) wv5",fontsize=16,color="burlywood",shape="box"];4237[label="wv4010/Succ wv40100",fontsize=10,color="white",style="solid",shape="box"];149 -> 4237[label="",style="solid", color="burlywood", weight=9];
4237 -> 180[label="",style="solid", color="burlywood", weight=3];
4238[label="wv4010/Zero",fontsize=10,color="white",style="solid",shape="box"];149 -> 4238[label="",style="solid", color="burlywood", weight=9];
4238 -> 181[label="",style="solid", color="burlywood", weight=3];
150[label="(++) intersectBy000 (Pos Zero :% Neg Zero) ((||) primEqInt (Neg Zero) (Neg wv4010) foldr (||) False (map ((==) Pos Zero :% Neg Zero) wv41)) wv5",fontsize=16,color="burlywood",shape="box"];4239[label="wv4010/Succ wv40100",fontsize=10,color="white",style="solid",shape="box"];150 -> 4239[label="",style="solid", color="burlywood", weight=9];
4239 -> 182[label="",style="solid", color="burlywood", weight=3];
4240[label="wv4010/Zero",fontsize=10,color="white",style="solid",shape="box"];150 -> 4240[label="",style="solid", color="burlywood", weight=9];
4240 -> 183[label="",style="solid", color="burlywood", weight=3];
2523[label="wv270",fontsize=16,color="green",shape="box"];2524[label="wv260",fontsize=16,color="green",shape="box"];2525[label="wv24",fontsize=16,color="green",shape="box"];2526[label="wv25",fontsize=16,color="green",shape="box"];2527[label="wv28",fontsize=16,color="green",shape="box"];2528[label="wv29",fontsize=16,color="green",shape="box"];2529[label="wv30",fontsize=16,color="green",shape="box"];2530[label="wv24",fontsize=16,color="green",shape="box"];2531[label="wv25",fontsize=16,color="green",shape="box"];2532[label="wv28",fontsize=16,color="green",shape="box"];2533[label="wv29",fontsize=16,color="green",shape="box"];2534[label="wv30",fontsize=16,color="green",shape="box"];2535[label="(++) intersectBy000 (Neg (Succ wv24) :% wv25) ((||) wv25 == wv28 foldr (||) False (map ((==) Neg (Succ wv24) :% wv25) wv29)) wv30",fontsize=16,color="black",shape="box"];2535 -> 2554[label="",style="solid", color="black", weight=3];
156[label="(++) intersectBy000 (Neg Zero :% Pos (Succ wv30100)) ((||) primEqInt (Pos (Succ wv30100)) (Pos wv4010) foldr (||) False (map ((==) Neg Zero :% Pos (Succ wv30100)) wv41)) wv5",fontsize=16,color="burlywood",shape="box"];4241[label="wv4010/Succ wv40100",fontsize=10,color="white",style="solid",shape="box"];156 -> 4241[label="",style="solid", color="burlywood", weight=9];
4241 -> 190[label="",style="solid", color="burlywood", weight=3];
4242[label="wv4010/Zero",fontsize=10,color="white",style="solid",shape="box"];156 -> 4242[label="",style="solid", color="burlywood", weight=9];
4242 -> 191[label="",style="solid", color="burlywood", weight=3];
157[label="(++) intersectBy000 (Neg Zero :% Pos (Succ wv30100)) ((||) primEqInt (Pos (Succ wv30100)) (Neg wv4010) foldr (||) False (map ((==) Neg Zero :% Pos (Succ wv30100)) wv41)) wv5",fontsize=16,color="black",shape="box"];157 -> 192[label="",style="solid", color="black", weight=3];
158[label="(++) intersectBy000 (Neg Zero :% Pos Zero) ((||) primEqInt (Pos Zero) (Pos wv4010) foldr (||) False (map ((==) Neg Zero :% Pos Zero) wv41)) wv5",fontsize=16,color="burlywood",shape="box"];4243[label="wv4010/Succ wv40100",fontsize=10,color="white",style="solid",shape="box"];158 -> 4243[label="",style="solid", color="burlywood", weight=9];
4243 -> 193[label="",style="solid", color="burlywood", weight=3];
4244[label="wv4010/Zero",fontsize=10,color="white",style="solid",shape="box"];158 -> 4244[label="",style="solid", color="burlywood", weight=9];
4244 -> 194[label="",style="solid", color="burlywood", weight=3];
159[label="(++) intersectBy000 (Neg Zero :% Pos Zero) ((||) primEqInt (Pos Zero) (Neg wv4010) foldr (||) False (map ((==) Neg Zero :% Pos Zero) wv41)) wv5",fontsize=16,color="burlywood",shape="box"];4245[label="wv4010/Succ wv40100",fontsize=10,color="white",style="solid",shape="box"];159 -> 4245[label="",style="solid", color="burlywood", weight=9];
4245 -> 195[label="",style="solid", color="burlywood", weight=3];
4246[label="wv4010/Zero",fontsize=10,color="white",style="solid",shape="box"];159 -> 4246[label="",style="solid", color="burlywood", weight=9];
4246 -> 196[label="",style="solid", color="burlywood", weight=3];
160[label="(++) intersectBy000 (Neg Zero :% Neg (Succ wv30100)) ((||) primEqInt (Neg (Succ wv30100)) (Pos wv4010) foldr (||) False (map ((==) Neg Zero :% Neg (Succ wv30100)) wv41)) wv5",fontsize=16,color="black",shape="box"];160 -> 197[label="",style="solid", color="black", weight=3];
161[label="(++) intersectBy000 (Neg Zero :% Neg (Succ wv30100)) ((||) primEqInt (Neg (Succ wv30100)) (Neg wv4010) foldr (||) False (map ((==) Neg Zero :% Neg (Succ wv30100)) wv41)) wv5",fontsize=16,color="burlywood",shape="box"];4247[label="wv4010/Succ wv40100",fontsize=10,color="white",style="solid",shape="box"];161 -> 4247[label="",style="solid", color="burlywood", weight=9];
4247 -> 198[label="",style="solid", color="burlywood", weight=3];
4248[label="wv4010/Zero",fontsize=10,color="white",style="solid",shape="box"];161 -> 4248[label="",style="solid", color="burlywood", weight=9];
4248 -> 199[label="",style="solid", color="burlywood", weight=3];
162[label="(++) intersectBy000 (Neg Zero :% Neg Zero) ((||) primEqInt (Neg Zero) (Pos wv4010) foldr (||) False (map ((==) Neg Zero :% Neg Zero) wv41)) wv5",fontsize=16,color="burlywood",shape="box"];4249[label="wv4010/Succ wv40100",fontsize=10,color="white",style="solid",shape="box"];162 -> 4249[label="",style="solid", color="burlywood", weight=9];
4249 -> 200[label="",style="solid", color="burlywood", weight=3];
4250[label="wv4010/Zero",fontsize=10,color="white",style="solid",shape="box"];162 -> 4250[label="",style="solid", color="burlywood", weight=9];
4250 -> 201[label="",style="solid", color="burlywood", weight=3];
163[label="(++) intersectBy000 (Neg Zero :% Neg Zero) ((||) primEqInt (Neg Zero) (Neg wv4010) foldr (||) False (map ((==) Neg Zero :% Neg Zero) wv41)) wv5",fontsize=16,color="burlywood",shape="box"];4251[label="wv4010/Succ wv40100",fontsize=10,color="white",style="solid",shape="box"];163 -> 4251[label="",style="solid", color="burlywood", weight=9];
4251 -> 202[label="",style="solid", color="burlywood", weight=3];
4252[label="wv4010/Zero",fontsize=10,color="white",style="solid",shape="box"];163 -> 4252[label="",style="solid", color="burlywood", weight=9];
4252 -> 203[label="",style="solid", color="burlywood", weight=3];
2536[label="(++) intersectBy000 (Pos (Succ wv16) :% wv17) ((||) primEqInt wv17 wv20 foldr (||) False (map ((==) Pos (Succ wv16) :% wv17) wv21)) wv22",fontsize=16,color="burlywood",shape="box"];4253[label="wv17/Pos wv170",fontsize=10,color="white",style="solid",shape="box"];2536 -> 4253[label="",style="solid", color="burlywood", weight=9];
4253 -> 2555[label="",style="solid", color="burlywood", weight=3];
4254[label="wv17/Neg wv170",fontsize=10,color="white",style="solid",shape="box"];2536 -> 4254[label="",style="solid", color="burlywood", weight=9];
4254 -> 2556[label="",style="solid", color="burlywood", weight=3];
170[label="(++) intersectBy000 (Pos Zero :% Pos (Succ wv30100)) ((||) primEqInt (Pos (Succ wv30100)) (Pos (Succ wv40100)) foldr (||) False (map ((==) Pos Zero :% Pos (Succ wv30100)) wv41)) wv5",fontsize=16,color="black",shape="box"];170 -> 213[label="",style="solid", color="black", weight=3];
171[label="(++) intersectBy000 (Pos Zero :% Pos (Succ wv30100)) ((||) primEqInt (Pos (Succ wv30100)) (Pos Zero) foldr (||) False (map ((==) Pos Zero :% Pos (Succ wv30100)) wv41)) wv5",fontsize=16,color="black",shape="box"];171 -> 214[label="",style="solid", color="black", weight=3];
172 -> 81[label="",style="dashed", color="red", weight=0];
172[label="(++) intersectBy000 (Pos Zero :% Pos (Succ wv30100)) ((||) False foldr (||) False (map ((==) Pos Zero :% Pos (Succ wv30100)) wv41)) wv5",fontsize=16,color="magenta"];172 -> 215[label="",style="dashed", color="magenta", weight=3];
173[label="(++) intersectBy000 (Pos Zero :% Pos Zero) ((||) primEqInt (Pos Zero) (Pos (Succ wv40100)) foldr (||) False (map ((==) Pos Zero :% Pos Zero) wv41)) wv5",fontsize=16,color="black",shape="box"];173 -> 216[label="",style="solid", color="black", weight=3];
174[label="(++) intersectBy000 (Pos Zero :% Pos Zero) ((||) primEqInt (Pos Zero) (Pos Zero) foldr (||) False (map ((==) Pos Zero :% Pos Zero) wv41)) wv5",fontsize=16,color="black",shape="box"];174 -> 217[label="",style="solid", color="black", weight=3];
175[label="(++) intersectBy000 (Pos Zero :% Pos Zero) ((||) primEqInt (Pos Zero) (Neg (Succ wv40100)) foldr (||) False (map ((==) Pos Zero :% Pos Zero) wv41)) wv5",fontsize=16,color="black",shape="box"];175 -> 218[label="",style="solid", color="black", weight=3];
176[label="(++) intersectBy000 (Pos Zero :% Pos Zero) ((||) primEqInt (Pos Zero) (Neg Zero) foldr (||) False (map ((==) Pos Zero :% Pos Zero) wv41)) wv5",fontsize=16,color="black",shape="box"];176 -> 219[label="",style="solid", color="black", weight=3];
177 -> 81[label="",style="dashed", color="red", weight=0];
177[label="(++) intersectBy000 (Pos Zero :% Neg (Succ wv30100)) ((||) False foldr (||) False (map ((==) Pos Zero :% Neg (Succ wv30100)) wv41)) wv5",fontsize=16,color="magenta"];177 -> 220[label="",style="dashed", color="magenta", weight=3];
178[label="(++) intersectBy000 (Pos Zero :% Neg (Succ wv30100)) ((||) primEqInt (Neg (Succ wv30100)) (Neg (Succ wv40100)) foldr (||) False (map ((==) Pos Zero :% Neg (Succ wv30100)) wv41)) wv5",fontsize=16,color="black",shape="box"];178 -> 221[label="",style="solid", color="black", weight=3];
179[label="(++) intersectBy000 (Pos Zero :% Neg (Succ wv30100)) ((||) primEqInt (Neg (Succ wv30100)) (Neg Zero) foldr (||) False (map ((==) Pos Zero :% Neg (Succ wv30100)) wv41)) wv5",fontsize=16,color="black",shape="box"];179 -> 222[label="",style="solid", color="black", weight=3];
180[label="(++) intersectBy000 (Pos Zero :% Neg Zero) ((||) primEqInt (Neg Zero) (Pos (Succ wv40100)) foldr (||) False (map ((==) Pos Zero :% Neg Zero) wv41)) wv5",fontsize=16,color="black",shape="box"];180 -> 223[label="",style="solid", color="black", weight=3];
181[label="(++) intersectBy000 (Pos Zero :% Neg Zero) ((||) primEqInt (Neg Zero) (Pos Zero) foldr (||) False (map ((==) Pos Zero :% Neg Zero) wv41)) wv5",fontsize=16,color="black",shape="box"];181 -> 224[label="",style="solid", color="black", weight=3];
182[label="(++) intersectBy000 (Pos Zero :% Neg Zero) ((||) primEqInt (Neg Zero) (Neg (Succ wv40100)) foldr (||) False (map ((==) Pos Zero :% Neg Zero) wv41)) wv5",fontsize=16,color="black",shape="box"];182 -> 225[label="",style="solid", color="black", weight=3];
183[label="(++) intersectBy000 (Pos Zero :% Neg Zero) ((||) primEqInt (Neg Zero) (Neg Zero) foldr (||) False (map ((==) Pos Zero :% Neg Zero) wv41)) wv5",fontsize=16,color="black",shape="box"];183 -> 226[label="",style="solid", color="black", weight=3];
2554[label="(++) intersectBy000 (Neg (Succ wv24) :% wv25) ((||) primEqInt wv25 wv28 foldr (||) False (map ((==) Neg (Succ wv24) :% wv25) wv29)) wv30",fontsize=16,color="burlywood",shape="box"];4257[label="wv25/Pos wv250",fontsize=10,color="white",style="solid",shape="box"];2554 -> 4257[label="",style="solid", color="burlywood", weight=9];
4257 -> 2580[label="",style="solid", color="burlywood", weight=3];
4258[label="wv25/Neg wv250",fontsize=10,color="white",style="solid",shape="box"];2554 -> 4258[label="",style="solid", color="burlywood", weight=9];
4258 -> 2581[label="",style="solid", color="burlywood", weight=3];
190[label="(++) intersectBy000 (Neg Zero :% Pos (Succ wv30100)) ((||) primEqInt (Pos (Succ wv30100)) (Pos (Succ wv40100)) foldr (||) False (map ((==) Neg Zero :% Pos (Succ wv30100)) wv41)) wv5",fontsize=16,color="black",shape="box"];190 -> 236[label="",style="solid", color="black", weight=3];
191[label="(++) intersectBy000 (Neg Zero :% Pos (Succ wv30100)) ((||) primEqInt (Pos (Succ wv30100)) (Pos Zero) foldr (||) False (map ((==) Neg Zero :% Pos (Succ wv30100)) wv41)) wv5",fontsize=16,color="black",shape="box"];191 -> 237[label="",style="solid", color="black", weight=3];
192 -> 86[label="",style="dashed", color="red", weight=0];
192[label="(++) intersectBy000 (Neg Zero :% Pos (Succ wv30100)) ((||) False foldr (||) False (map ((==) Neg Zero :% Pos (Succ wv30100)) wv41)) wv5",fontsize=16,color="magenta"];192 -> 238[label="",style="dashed", color="magenta", weight=3];
193[label="(++) intersectBy000 (Neg Zero :% Pos Zero) ((||) primEqInt (Pos Zero) (Pos (Succ wv40100)) foldr (||) False (map ((==) Neg Zero :% Pos Zero) wv41)) wv5",fontsize=16,color="black",shape="box"];193 -> 239[label="",style="solid", color="black", weight=3];
194[label="(++) intersectBy000 (Neg Zero :% Pos Zero) ((||) primEqInt (Pos Zero) (Pos Zero) foldr (||) False (map ((==) Neg Zero :% Pos Zero) wv41)) wv5",fontsize=16,color="black",shape="box"];194 -> 240[label="",style="solid", color="black", weight=3];
195[label="(++) intersectBy000 (Neg Zero :% Pos Zero) ((||) primEqInt (Pos Zero) (Neg (Succ wv40100)) foldr (||) False (map ((==) Neg Zero :% Pos Zero) wv41)) wv5",fontsize=16,color="black",shape="box"];195 -> 241[label="",style="solid", color="black", weight=3];
196[label="(++) intersectBy000 (Neg Zero :% Pos Zero) ((||) primEqInt (Pos Zero) (Neg Zero) foldr (||) False (map ((==) Neg Zero :% Pos Zero) wv41)) wv5",fontsize=16,color="black",shape="box"];196 -> 242[label="",style="solid", color="black", weight=3];
197 -> 86[label="",style="dashed", color="red", weight=0];
197[label="(++) intersectBy000 (Neg Zero :% Neg (Succ wv30100)) ((||) False foldr (||) False (map ((==) Neg Zero :% Neg (Succ wv30100)) wv41)) wv5",fontsize=16,color="magenta"];197 -> 243[label="",style="dashed", color="magenta", weight=3];
198[label="(++) intersectBy000 (Neg Zero :% Neg (Succ wv30100)) ((||) primEqInt (Neg (Succ wv30100)) (Neg (Succ wv40100)) foldr (||) False (map ((==) Neg Zero :% Neg (Succ wv30100)) wv41)) wv5",fontsize=16,color="black",shape="box"];198 -> 244[label="",style="solid", color="black", weight=3];
199[label="(++) intersectBy000 (Neg Zero :% Neg (Succ wv30100)) ((||) primEqInt (Neg (Succ wv30100)) (Neg Zero) foldr (||) False (map ((==) Neg Zero :% Neg (Succ wv30100)) wv41)) wv5",fontsize=16,color="black",shape="box"];199 -> 245[label="",style="solid", color="black", weight=3];
200[label="(++) intersectBy000 (Neg Zero :% Neg Zero) ((||) primEqInt (Neg Zero) (Pos (Succ wv40100)) foldr (||) False (map ((==) Neg Zero :% Neg Zero) wv41)) wv5",fontsize=16,color="black",shape="box"];200 -> 246[label="",style="solid", color="black", weight=3];
201[label="(++) intersectBy000 (Neg Zero :% Neg Zero) ((||) primEqInt (Neg Zero) (Pos Zero) foldr (||) False (map ((==) Neg Zero :% Neg Zero) wv41)) wv5",fontsize=16,color="black",shape="box"];201 -> 247[label="",style="solid", color="black", weight=3];
202[label="(++) intersectBy000 (Neg Zero :% Neg Zero) ((||) primEqInt (Neg Zero) (Neg (Succ wv40100)) foldr (||) False (map ((==) Neg Zero :% Neg Zero) wv41)) wv5",fontsize=16,color="black",shape="box"];202 -> 248[label="",style="solid", color="black", weight=3];
203[label="(++) intersectBy000 (Neg Zero :% Neg Zero) ((||) primEqInt (Neg Zero) (Neg Zero) foldr (||) False (map ((==) Neg Zero :% Neg Zero) wv41)) wv5",fontsize=16,color="black",shape="box"];203 -> 249[label="",style="solid", color="black", weight=3];
2555[label="(++) intersectBy000 (Pos (Succ wv16) :% Pos wv170) ((||) primEqInt (Pos wv170) wv20 foldr (||) False (map ((==) Pos (Succ wv16) :% Pos wv170) wv21)) wv22",fontsize=16,color="burlywood",shape="box"];4261[label="wv170/Succ wv1700",fontsize=10,color="white",style="solid",shape="box"];2555 -> 4261[label="",style="solid", color="burlywood", weight=9];
4261 -> 2582[label="",style="solid", color="burlywood", weight=3];
4262[label="wv170/Zero",fontsize=10,color="white",style="solid",shape="box"];2555 -> 4262[label="",style="solid", color="burlywood", weight=9];
4262 -> 2583[label="",style="solid", color="burlywood", weight=3];
2556[label="(++) intersectBy000 (Pos (Succ wv16) :% Neg wv170) ((||) primEqInt (Neg wv170) wv20 foldr (||) False (map ((==) Pos (Succ wv16) :% Neg wv170) wv21)) wv22",fontsize=16,color="burlywood",shape="box"];4263[label="wv170/Succ wv1700",fontsize=10,color="white",style="solid",shape="box"];2556 -> 4263[label="",style="solid", color="burlywood", weight=9];
4263 -> 2584[label="",style="solid", color="burlywood", weight=3];
4264[label="wv170/Zero",fontsize=10,color="white",style="solid",shape="box"];2556 -> 4264[label="",style="solid", color="burlywood", weight=9];
4264 -> 2585[label="",style="solid", color="burlywood", weight=3];
213 -> 2718[label="",style="dashed", color="red", weight=0];
213[label="(++) intersectBy000 (Pos Zero :% Pos (Succ wv30100)) ((||) primEqNat wv30100 wv40100 foldr (||) False (map ((==) Pos Zero :% Pos (Succ wv30100)) wv41)) wv5",fontsize=16,color="magenta"];213 -> 2719[label="",style="dashed", color="magenta", weight=3];
213 -> 2720[label="",style="dashed", color="magenta", weight=3];
213 -> 2721[label="",style="dashed", color="magenta", weight=3];
213 -> 2722[label="",style="dashed", color="magenta", weight=3];
213 -> 2723[label="",style="dashed", color="magenta", weight=3];
214 -> 81[label="",style="dashed", color="red", weight=0];
214[label="(++) intersectBy000 (Pos Zero :% Pos (Succ wv30100)) ((||) False foldr (||) False (map ((==) Pos Zero :% Pos (Succ wv30100)) wv41)) wv5",fontsize=16,color="magenta"];214 -> 265[label="",style="dashed", color="magenta", weight=3];
215[label="Pos (Succ wv30100)",fontsize=16,color="green",shape="box"];216 -> 81[label="",style="dashed", color="red", weight=0];
216[label="(++) intersectBy000 (Pos Zero :% Pos Zero) ((||) False foldr (||) False (map ((==) Pos Zero :% Pos Zero) wv41)) wv5",fontsize=16,color="magenta"];216 -> 266[label="",style="dashed", color="magenta", weight=3];
217[label="(++) intersectBy000 (Pos Zero :% Pos Zero) ((||) True foldr (||) False (map ((==) Pos Zero :% Pos Zero) wv41)) wv5",fontsize=16,color="black",shape="triangle"];217 -> 267[label="",style="solid", color="black", weight=3];
218 -> 81[label="",style="dashed", color="red", weight=0];
218[label="(++) intersectBy000 (Pos Zero :% Pos Zero) ((||) False foldr (||) False (map ((==) Pos Zero :% Pos Zero) wv41)) wv5",fontsize=16,color="magenta"];218 -> 268[label="",style="dashed", color="magenta", weight=3];
219 -> 217[label="",style="dashed", color="red", weight=0];
219[label="(++) intersectBy000 (Pos Zero :% Pos Zero) ((||) True foldr (||) False (map ((==) Pos Zero :% Pos Zero) wv41)) wv5",fontsize=16,color="magenta"];220[label="Neg (Succ wv30100)",fontsize=16,color="green",shape="box"];221 -> 2817[label="",style="dashed", color="red", weight=0];
221[label="(++) intersectBy000 (Pos Zero :% Neg (Succ wv30100)) ((||) primEqNat wv30100 wv40100 foldr (||) False (map ((==) Pos Zero :% Neg (Succ wv30100)) wv41)) wv5",fontsize=16,color="magenta"];221 -> 2818[label="",style="dashed", color="magenta", weight=3];
221 -> 2819[label="",style="dashed", color="magenta", weight=3];
221 -> 2820[label="",style="dashed", color="magenta", weight=3];
221 -> 2821[label="",style="dashed", color="magenta", weight=3];
221 -> 2822[label="",style="dashed", color="magenta", weight=3];
222 -> 81[label="",style="dashed", color="red", weight=0];
222[label="(++) intersectBy000 (Pos Zero :% Neg (Succ wv30100)) ((||) False foldr (||) False (map ((==) Pos Zero :% Neg (Succ wv30100)) wv41)) wv5",fontsize=16,color="magenta"];222 -> 271[label="",style="dashed", color="magenta", weight=3];
223 -> 81[label="",style="dashed", color="red", weight=0];
223[label="(++) intersectBy000 (Pos Zero :% Neg Zero) ((||) False foldr (||) False (map ((==) Pos Zero :% Neg Zero) wv41)) wv5",fontsize=16,color="magenta"];223 -> 272[label="",style="dashed", color="magenta", weight=3];
224[label="(++) intersectBy000 (Pos Zero :% Neg Zero) ((||) True foldr (||) False (map ((==) Pos Zero :% Neg Zero) wv41)) wv5",fontsize=16,color="black",shape="triangle"];224 -> 273[label="",style="solid", color="black", weight=3];
225 -> 81[label="",style="dashed", color="red", weight=0];
225[label="(++) intersectBy000 (Pos Zero :% Neg Zero) ((||) False foldr (||) False (map ((==) Pos Zero :% Neg Zero) wv41)) wv5",fontsize=16,color="magenta"];225 -> 274[label="",style="dashed", color="magenta", weight=3];
226 -> 224[label="",style="dashed", color="red", weight=0];
226[label="(++) intersectBy000 (Pos Zero :% Neg Zero) ((||) True foldr (||) False (map ((==) Pos Zero :% Neg Zero) wv41)) wv5",fontsize=16,color="magenta"];2580[label="(++) intersectBy000 (Neg (Succ wv24) :% Pos wv250) ((||) primEqInt (Pos wv250) wv28 foldr (||) False (map ((==) Neg (Succ wv24) :% Pos wv250) wv29)) wv30",fontsize=16,color="burlywood",shape="box"];4275[label="wv250/Succ wv2500",fontsize=10,color="white",style="solid",shape="box"];2580 -> 4275[label="",style="solid", color="burlywood", weight=9];
4275 -> 2608[label="",style="solid", color="burlywood", weight=3];
4276[label="wv250/Zero",fontsize=10,color="white",style="solid",shape="box"];2580 -> 4276[label="",style="solid", color="burlywood", weight=9];
4276 -> 2609[label="",style="solid", color="burlywood", weight=3];
2581[label="(++) intersectBy000 (Neg (Succ wv24) :% Neg wv250) ((||) primEqInt (Neg wv250) wv28 foldr (||) False (map ((==) Neg (Succ wv24) :% Neg wv250) wv29)) wv30",fontsize=16,color="burlywood",shape="box"];4277[label="wv250/Succ wv2500",fontsize=10,color="white",style="solid",shape="box"];2581 -> 4277[label="",style="solid", color="burlywood", weight=9];
4277 -> 2610[label="",style="solid", color="burlywood", weight=3];
4278[label="wv250/Zero",fontsize=10,color="white",style="solid",shape="box"];2581 -> 4278[label="",style="solid", color="burlywood", weight=9];
4278 -> 2611[label="",style="solid", color="burlywood", weight=3];
236 -> 2910[label="",style="dashed", color="red", weight=0];
236[label="(++) intersectBy000 (Neg Zero :% Pos (Succ wv30100)) ((||) primEqNat wv30100 wv40100 foldr (||) False (map ((==) Neg Zero :% Pos (Succ wv30100)) wv41)) wv5",fontsize=16,color="magenta"];236 -> 2911[label="",style="dashed", color="magenta", weight=3];
236 -> 2912[label="",style="dashed", color="magenta", weight=3];
236 -> 2913[label="",style="dashed", color="magenta", weight=3];
236 -> 2914[label="",style="dashed", color="magenta", weight=3];
236 -> 2915[label="",style="dashed", color="magenta", weight=3];
237 -> 86[label="",style="dashed", color="red", weight=0];
237[label="(++) intersectBy000 (Neg Zero :% Pos (Succ wv30100)) ((||) False foldr (||) False (map ((==) Neg Zero :% Pos (Succ wv30100)) wv41)) wv5",fontsize=16,color="magenta"];237 -> 290[label="",style="dashed", color="magenta", weight=3];
238[label="Pos (Succ wv30100)",fontsize=16,color="green",shape="box"];239 -> 86[label="",style="dashed", color="red", weight=0];
239[label="(++) intersectBy000 (Neg Zero :% Pos Zero) ((||) False foldr (||) False (map ((==) Neg Zero :% Pos Zero) wv41)) wv5",fontsize=16,color="magenta"];239 -> 291[label="",style="dashed", color="magenta", weight=3];
240[label="(++) intersectBy000 (Neg Zero :% Pos Zero) ((||) True foldr (||) False (map ((==) Neg Zero :% Pos Zero) wv41)) wv5",fontsize=16,color="black",shape="triangle"];240 -> 292[label="",style="solid", color="black", weight=3];
241 -> 86[label="",style="dashed", color="red", weight=0];
241[label="(++) intersectBy000 (Neg Zero :% Pos Zero) ((||) False foldr (||) False (map ((==) Neg Zero :% Pos Zero) wv41)) wv5",fontsize=16,color="magenta"];241 -> 293[label="",style="dashed", color="magenta", weight=3];
242 -> 240[label="",style="dashed", color="red", weight=0];
242[label="(++) intersectBy000 (Neg Zero :% Pos Zero) ((||) True foldr (||) False (map ((==) Neg Zero :% Pos Zero) wv41)) wv5",fontsize=16,color="magenta"];243[label="Neg (Succ wv30100)",fontsize=16,color="green",shape="box"];244 -> 2986[label="",style="dashed", color="red", weight=0];
244[label="(++) intersectBy000 (Neg Zero :% Neg (Succ wv30100)) ((||) primEqNat wv30100 wv40100 foldr (||) False (map ((==) Neg Zero :% Neg (Succ wv30100)) wv41)) wv5",fontsize=16,color="magenta"];244 -> 2987[label="",style="dashed", color="magenta", weight=3];
244 -> 2988[label="",style="dashed", color="magenta", weight=3];
244 -> 2989[label="",style="dashed", color="magenta", weight=3];
244 -> 2990[label="",style="dashed", color="magenta", weight=3];
244 -> 2991[label="",style="dashed", color="magenta", weight=3];
245 -> 86[label="",style="dashed", color="red", weight=0];
245[label="(++) intersectBy000 (Neg Zero :% Neg (Succ wv30100)) ((||) False foldr (||) False (map ((==) Neg Zero :% Neg (Succ wv30100)) wv41)) wv5",fontsize=16,color="magenta"];245 -> 296[label="",style="dashed", color="magenta", weight=3];
246 -> 86[label="",style="dashed", color="red", weight=0];
246[label="(++) intersectBy000 (Neg Zero :% Neg Zero) ((||) False foldr (||) False (map ((==) Neg Zero :% Neg Zero) wv41)) wv5",fontsize=16,color="magenta"];246 -> 297[label="",style="dashed", color="magenta", weight=3];
247[label="(++) intersectBy000 (Neg Zero :% Neg Zero) ((||) True foldr (||) False (map ((==) Neg Zero :% Neg Zero) wv41)) wv5",fontsize=16,color="black",shape="triangle"];247 -> 298[label="",style="solid", color="black", weight=3];
248 -> 86[label="",style="dashed", color="red", weight=0];
248[label="(++) intersectBy000 (Neg Zero :% Neg Zero) ((||) False foldr (||) False (map ((==) Neg Zero :% Neg Zero) wv41)) wv5",fontsize=16,color="magenta"];248 -> 299[label="",style="dashed", color="magenta", weight=3];
249 -> 247[label="",style="dashed", color="red", weight=0];
249[label="(++) intersectBy000 (Neg Zero :% Neg Zero) ((||) True foldr (||) False (map ((==) Neg Zero :% Neg Zero) wv41)) wv5",fontsize=16,color="magenta"];2582[label="(++) intersectBy000 (Pos (Succ wv16) :% Pos (Succ wv1700)) ((||) primEqInt (Pos (Succ wv1700)) wv20 foldr (||) False (map ((==) Pos (Succ wv16) :% Pos (Succ wv1700)) wv21)) wv22",fontsize=16,color="burlywood",shape="box"];4289[label="wv20/Pos wv200",fontsize=10,color="white",style="solid",shape="box"];2582 -> 4289[label="",style="solid", color="burlywood", weight=9];
4289 -> 2612[label="",style="solid", color="burlywood", weight=3];
4290[label="wv20/Neg wv200",fontsize=10,color="white",style="solid",shape="box"];2582 -> 4290[label="",style="solid", color="burlywood", weight=9];
4290 -> 2613[label="",style="solid", color="burlywood", weight=3];
2583[label="(++) intersectBy000 (Pos (Succ wv16) :% Pos Zero) ((||) primEqInt (Pos Zero) wv20 foldr (||) False (map ((==) Pos (Succ wv16) :% Pos Zero) wv21)) wv22",fontsize=16,color="burlywood",shape="box"];4291[label="wv20/Pos wv200",fontsize=10,color="white",style="solid",shape="box"];2583 -> 4291[label="",style="solid", color="burlywood", weight=9];
4291 -> 2614[label="",style="solid", color="burlywood", weight=3];
4292[label="wv20/Neg wv200",fontsize=10,color="white",style="solid",shape="box"];2583 -> 4292[label="",style="solid", color="burlywood", weight=9];
4292 -> 2615[label="",style="solid", color="burlywood", weight=3];
2584[label="(++) intersectBy000 (Pos (Succ wv16) :% Neg (Succ wv1700)) ((||) primEqInt (Neg (Succ wv1700)) wv20 foldr (||) False (map ((==) Pos (Succ wv16) :% Neg (Succ wv1700)) wv21)) wv22",fontsize=16,color="burlywood",shape="box"];4293[label="wv20/Pos wv200",fontsize=10,color="white",style="solid",shape="box"];2584 -> 4293[label="",style="solid", color="burlywood", weight=9];
4293 -> 2616[label="",style="solid", color="burlywood", weight=3];
4294[label="wv20/Neg wv200",fontsize=10,color="white",style="solid",shape="box"];2584 -> 4294[label="",style="solid", color="burlywood", weight=9];
4294 -> 2617[label="",style="solid", color="burlywood", weight=3];
2585[label="(++) intersectBy000 (Pos (Succ wv16) :% Neg Zero) ((||) primEqInt (Neg Zero) wv20 foldr (||) False (map ((==) Pos (Succ wv16) :% Neg Zero) wv21)) wv22",fontsize=16,color="burlywood",shape="box"];4295[label="wv20/Pos wv200",fontsize=10,color="white",style="solid",shape="box"];2585 -> 4295[label="",style="solid", color="burlywood", weight=9];
4295 -> 2618[label="",style="solid", color="burlywood", weight=3];
4296[label="wv20/Neg wv200",fontsize=10,color="white",style="solid",shape="box"];2585 -> 4296[label="",style="solid", color="burlywood", weight=9];
4296 -> 2619[label="",style="solid", color="burlywood", weight=3];
2719[label="wv5",fontsize=16,color="green",shape="box"];2720[label="wv41",fontsize=16,color="green",shape="box"];2721[label="wv40100",fontsize=16,color="green",shape="box"];2722[label="wv30100",fontsize=16,color="green",shape="box"];2723[label="wv30100",fontsize=16,color="green",shape="box"];2718[label="(++) intersectBy000 (Pos Zero :% Pos (Succ wv38)) ((||) primEqNat wv39 wv40 foldr (||) False (map ((==) Pos Zero :% Pos (Succ wv38)) wv41)) wv42",fontsize=16,color="burlywood",shape="triangle"];4297[label="wv39/Succ wv390",fontsize=10,color="white",style="solid",shape="box"];2718 -> 4297[label="",style="solid", color="burlywood", weight=9];
4297 -> 2764[label="",style="solid", color="burlywood", weight=3];
4298[label="wv39/Zero",fontsize=10,color="white",style="solid",shape="box"];2718 -> 4298[label="",style="solid", color="burlywood", weight=9];
4298 -> 2765[label="",style="solid", color="burlywood", weight=3];
265[label="Pos (Succ wv30100)",fontsize=16,color="green",shape="box"];266[label="Pos Zero",fontsize=16,color="green",shape="box"];267[label="(++) intersectBy000 (Pos Zero :% Pos Zero) True wv5",fontsize=16,color="black",shape="box"];267 -> 324[label="",style="solid", color="black", weight=3];
268[label="Pos Zero",fontsize=16,color="green",shape="box"];2818[label="wv40100",fontsize=16,color="green",shape="box"];2819[label="wv30100",fontsize=16,color="green",shape="box"];2820[label="wv5",fontsize=16,color="green",shape="box"];2821[label="wv30100",fontsize=16,color="green",shape="box"];2822[label="wv41",fontsize=16,color="green",shape="box"];2817[label="(++) intersectBy000 (Pos Zero :% Neg (Succ wv44)) ((||) primEqNat wv45 wv46 foldr (||) False (map ((==) Pos Zero :% Neg (Succ wv44)) wv47)) wv48",fontsize=16,color="burlywood",shape="triangle"];4299[label="wv45/Succ wv450",fontsize=10,color="white",style="solid",shape="box"];2817 -> 4299[label="",style="solid", color="burlywood", weight=9];
4299 -> 2863[label="",style="solid", color="burlywood", weight=3];
4300[label="wv45/Zero",fontsize=10,color="white",style="solid",shape="box"];2817 -> 4300[label="",style="solid", color="burlywood", weight=9];
4300 -> 2864[label="",style="solid", color="burlywood", weight=3];
271[label="Neg (Succ wv30100)",fontsize=16,color="green",shape="box"];272[label="Neg Zero",fontsize=16,color="green",shape="box"];273[label="(++) intersectBy000 (Pos Zero :% Neg Zero) True wv5",fontsize=16,color="black",shape="box"];273 -> 329[label="",style="solid", color="black", weight=3];
274[label="Neg Zero",fontsize=16,color="green",shape="box"];2608[label="(++) intersectBy000 (Neg (Succ wv24) :% Pos (Succ wv2500)) ((||) primEqInt (Pos (Succ wv2500)) wv28 foldr (||) False (map ((==) Neg (Succ wv24) :% Pos (Succ wv2500)) wv29)) wv30",fontsize=16,color="burlywood",shape="box"];4301[label="wv28/Pos wv280",fontsize=10,color="white",style="solid",shape="box"];2608 -> 4301[label="",style="solid", color="burlywood", weight=9];
4301 -> 2642[label="",style="solid", color="burlywood", weight=3];
4302[label="wv28/Neg wv280",fontsize=10,color="white",style="solid",shape="box"];2608 -> 4302[label="",style="solid", color="burlywood", weight=9];
4302 -> 2643[label="",style="solid", color="burlywood", weight=3];
2609[label="(++) intersectBy000 (Neg (Succ wv24) :% Pos Zero) ((||) primEqInt (Pos Zero) wv28 foldr (||) False (map ((==) Neg (Succ wv24) :% Pos Zero) wv29)) wv30",fontsize=16,color="burlywood",shape="box"];4303[label="wv28/Pos wv280",fontsize=10,color="white",style="solid",shape="box"];2609 -> 4303[label="",style="solid", color="burlywood", weight=9];
4303 -> 2644[label="",style="solid", color="burlywood", weight=3];
4304[label="wv28/Neg wv280",fontsize=10,color="white",style="solid",shape="box"];2609 -> 4304[label="",style="solid", color="burlywood", weight=9];
4304 -> 2645[label="",style="solid", color="burlywood", weight=3];
2610[label="(++) intersectBy000 (Neg (Succ wv24) :% Neg (Succ wv2500)) ((||) primEqInt (Neg (Succ wv2500)) wv28 foldr (||) False (map ((==) Neg (Succ wv24) :% Neg (Succ wv2500)) wv29)) wv30",fontsize=16,color="burlywood",shape="box"];4305[label="wv28/Pos wv280",fontsize=10,color="white",style="solid",shape="box"];2610 -> 4305[label="",style="solid", color="burlywood", weight=9];
4305 -> 2646[label="",style="solid", color="burlywood", weight=3];
4306[label="wv28/Neg wv280",fontsize=10,color="white",style="solid",shape="box"];2610 -> 4306[label="",style="solid", color="burlywood", weight=9];
4306 -> 2647[label="",style="solid", color="burlywood", weight=3];
2611[label="(++) intersectBy000 (Neg (Succ wv24) :% Neg Zero) ((||) primEqInt (Neg Zero) wv28 foldr (||) False (map ((==) Neg (Succ wv24) :% Neg Zero) wv29)) wv30",fontsize=16,color="burlywood",shape="box"];4307[label="wv28/Pos wv280",fontsize=10,color="white",style="solid",shape="box"];2611 -> 4307[label="",style="solid", color="burlywood", weight=9];
4307 -> 2648[label="",style="solid", color="burlywood", weight=3];
4308[label="wv28/Neg wv280",fontsize=10,color="white",style="solid",shape="box"];2611 -> 4308[label="",style="solid", color="burlywood", weight=9];
4308 -> 2649[label="",style="solid", color="burlywood", weight=3];
2911[label="wv41",fontsize=16,color="green",shape="box"];2912[label="wv5",fontsize=16,color="green",shape="box"];2913[label="wv30100",fontsize=16,color="green",shape="box"];2914[label="wv40100",fontsize=16,color="green",shape="box"];2915[label="wv30100",fontsize=16,color="green",shape="box"];2910[label="(++) intersectBy000 (Neg Zero :% Pos (Succ wv50)) ((||) primEqNat wv51 wv52 foldr (||) False (map ((==) Neg Zero :% Pos (Succ wv50)) wv53)) wv54",fontsize=16,color="burlywood",shape="triangle"];4309[label="wv51/Succ wv510",fontsize=10,color="white",style="solid",shape="box"];2910 -> 4309[label="",style="solid", color="burlywood", weight=9];
4309 -> 2956[label="",style="solid", color="burlywood", weight=3];
4310[label="wv51/Zero",fontsize=10,color="white",style="solid",shape="box"];2910 -> 4310[label="",style="solid", color="burlywood", weight=9];
4310 -> 2957[label="",style="solid", color="burlywood", weight=3];
290[label="Pos (Succ wv30100)",fontsize=16,color="green",shape="box"];291[label="Pos Zero",fontsize=16,color="green",shape="box"];292[label="(++) intersectBy000 (Neg Zero :% Pos Zero) True wv5",fontsize=16,color="black",shape="box"];292 -> 354[label="",style="solid", color="black", weight=3];
293[label="Pos Zero",fontsize=16,color="green",shape="box"];2987[label="wv5",fontsize=16,color="green",shape="box"];2988[label="wv41",fontsize=16,color="green",shape="box"];2989[label="wv30100",fontsize=16,color="green",shape="box"];2990[label="wv40100",fontsize=16,color="green",shape="box"];2991[label="wv30100",fontsize=16,color="green",shape="box"];2986[label="(++) intersectBy000 (Neg Zero :% Neg (Succ wv56)) ((||) primEqNat wv57 wv58 foldr (||) False (map ((==) Neg Zero :% Neg (Succ wv56)) wv59)) wv60",fontsize=16,color="burlywood",shape="triangle"];4311[label="wv57/Succ wv570",fontsize=10,color="white",style="solid",shape="box"];2986 -> 4311[label="",style="solid", color="burlywood", weight=9];
4311 -> 3032[label="",style="solid", color="burlywood", weight=3];
4312[label="wv57/Zero",fontsize=10,color="white",style="solid",shape="box"];2986 -> 4312[label="",style="solid", color="burlywood", weight=9];
4312 -> 3033[label="",style="solid", color="burlywood", weight=3];
296[label="Neg (Succ wv30100)",fontsize=16,color="green",shape="box"];297[label="Neg Zero",fontsize=16,color="green",shape="box"];298[label="(++) intersectBy000 (Neg Zero :% Neg Zero) True wv5",fontsize=16,color="black",shape="box"];298 -> 359[label="",style="solid", color="black", weight=3];
299[label="Neg Zero",fontsize=16,color="green",shape="box"];2612[label="(++) intersectBy000 (Pos (Succ wv16) :% Pos (Succ wv1700)) ((||) primEqInt (Pos (Succ wv1700)) (Pos wv200) foldr (||) False (map ((==) Pos (Succ wv16) :% Pos (Succ wv1700)) wv21)) wv22",fontsize=16,color="burlywood",shape="box"];4313[label="wv200/Succ wv2000",fontsize=10,color="white",style="solid",shape="box"];2612 -> 4313[label="",style="solid", color="burlywood", weight=9];
4313 -> 2650[label="",style="solid", color="burlywood", weight=3];
4314[label="wv200/Zero",fontsize=10,color="white",style="solid",shape="box"];2612 -> 4314[label="",style="solid", color="burlywood", weight=9];
4314 -> 2651[label="",style="solid", color="burlywood", weight=3];
2613[label="(++) intersectBy000 (Pos (Succ wv16) :% Pos (Succ wv1700)) ((||) primEqInt (Pos (Succ wv1700)) (Neg wv200) foldr (||) False (map ((==) Pos (Succ wv16) :% Pos (Succ wv1700)) wv21)) wv22",fontsize=16,color="black",shape="box"];2613 -> 2652[label="",style="solid", color="black", weight=3];
2614[label="(++) intersectBy000 (Pos (Succ wv16) :% Pos Zero) ((||) primEqInt (Pos Zero) (Pos wv200) foldr (||) False (map ((==) Pos (Succ wv16) :% Pos Zero) wv21)) wv22",fontsize=16,color="burlywood",shape="box"];4315[label="wv200/Succ wv2000",fontsize=10,color="white",style="solid",shape="box"];2614 -> 4315[label="",style="solid", color="burlywood", weight=9];
4315 -> 2653[label="",style="solid", color="burlywood", weight=3];
4316[label="wv200/Zero",fontsize=10,color="white",style="solid",shape="box"];2614 -> 4316[label="",style="solid", color="burlywood", weight=9];
4316 -> 2654[label="",style="solid", color="burlywood", weight=3];
2615[label="(++) intersectBy000 (Pos (Succ wv16) :% Pos Zero) ((||) primEqInt (Pos Zero) (Neg wv200) foldr (||) False (map ((==) Pos (Succ wv16) :% Pos Zero) wv21)) wv22",fontsize=16,color="burlywood",shape="box"];4317[label="wv200/Succ wv2000",fontsize=10,color="white",style="solid",shape="box"];2615 -> 4317[label="",style="solid", color="burlywood", weight=9];
4317 -> 2655[label="",style="solid", color="burlywood", weight=3];
4318[label="wv200/Zero",fontsize=10,color="white",style="solid",shape="box"];2615 -> 4318[label="",style="solid", color="burlywood", weight=9];
4318 -> 2656[label="",style="solid", color="burlywood", weight=3];
2616[label="(++) intersectBy000 (Pos (Succ wv16) :% Neg (Succ wv1700)) ((||) primEqInt (Neg (Succ wv1700)) (Pos wv200) foldr (||) False (map ((==) Pos (Succ wv16) :% Neg (Succ wv1700)) wv21)) wv22",fontsize=16,color="black",shape="box"];2616 -> 2657[label="",style="solid", color="black", weight=3];
2617[label="(++) intersectBy000 (Pos (Succ wv16) :% Neg (Succ wv1700)) ((||) primEqInt (Neg (Succ wv1700)) (Neg wv200) foldr (||) False (map ((==) Pos (Succ wv16) :% Neg (Succ wv1700)) wv21)) wv22",fontsize=16,color="burlywood",shape="box"];4319[label="wv200/Succ wv2000",fontsize=10,color="white",style="solid",shape="box"];2617 -> 4319[label="",style="solid", color="burlywood", weight=9];
4319 -> 2658[label="",style="solid", color="burlywood", weight=3];
4320[label="wv200/Zero",fontsize=10,color="white",style="solid",shape="box"];2617 -> 4320[label="",style="solid", color="burlywood", weight=9];
4320 -> 2659[label="",style="solid", color="burlywood", weight=3];
2618[label="(++) intersectBy000 (Pos (Succ wv16) :% Neg Zero) ((||) primEqInt (Neg Zero) (Pos wv200) foldr (||) False (map ((==) Pos (Succ wv16) :% Neg Zero) wv21)) wv22",fontsize=16,color="burlywood",shape="box"];4321[label="wv200/Succ wv2000",fontsize=10,color="white",style="solid",shape="box"];2618 -> 4321[label="",style="solid", color="burlywood", weight=9];
4321 -> 2660[label="",style="solid", color="burlywood", weight=3];
4322[label="wv200/Zero",fontsize=10,color="white",style="solid",shape="box"];2618 -> 4322[label="",style="solid", color="burlywood", weight=9];
4322 -> 2661[label="",style="solid", color="burlywood", weight=3];
2619[label="(++) intersectBy000 (Pos (Succ wv16) :% Neg Zero) ((||) primEqInt (Neg Zero) (Neg wv200) foldr (||) False (map ((==) Pos (Succ wv16) :% Neg Zero) wv21)) wv22",fontsize=16,color="burlywood",shape="box"];4323[label="wv200/Succ wv2000",fontsize=10,color="white",style="solid",shape="box"];2619 -> 4323[label="",style="solid", color="burlywood", weight=9];
4323 -> 2662[label="",style="solid", color="burlywood", weight=3];
4324[label="wv200/Zero",fontsize=10,color="white",style="solid",shape="box"];2619 -> 4324[label="",style="solid", color="burlywood", weight=9];
4324 -> 2663[label="",style="solid", color="burlywood", weight=3];
2764[label="(++) intersectBy000 (Pos Zero :% Pos (Succ wv38)) ((||) primEqNat (Succ wv390) wv40 foldr (||) False (map ((==) Pos Zero :% Pos (Succ wv38)) wv41)) wv42",fontsize=16,color="burlywood",shape="box"];4325[label="wv40/Succ wv400",fontsize=10,color="white",style="solid",shape="box"];2764 -> 4325[label="",style="solid", color="burlywood", weight=9];
4325 -> 2865[label="",style="solid", color="burlywood", weight=3];
4326[label="wv40/Zero",fontsize=10,color="white",style="solid",shape="box"];2764 -> 4326[label="",style="solid", color="burlywood", weight=9];
4326 -> 2866[label="",style="solid", color="burlywood", weight=3];
2765[label="(++) intersectBy000 (Pos Zero :% Pos (Succ wv38)) ((||) primEqNat Zero wv40 foldr (||) False (map ((==) Pos Zero :% Pos (Succ wv38)) wv41)) wv42",fontsize=16,color="burlywood",shape="box"];4327[label="wv40/Succ wv400",fontsize=10,color="white",style="solid",shape="box"];2765 -> 4327[label="",style="solid", color="burlywood", weight=9];
4327 -> 2867[label="",style="solid", color="burlywood", weight=3];
4328[label="wv40/Zero",fontsize=10,color="white",style="solid",shape="box"];2765 -> 4328[label="",style="solid", color="burlywood", weight=9];
4328 -> 2868[label="",style="solid", color="burlywood", weight=3];
324[label="(++) (Pos Zero :% Pos Zero : []) wv5",fontsize=16,color="black",shape="box"];324 -> 389[label="",style="solid", color="black", weight=3];
2863[label="(++) intersectBy000 (Pos Zero :% Neg (Succ wv44)) ((||) primEqNat (Succ wv450) wv46 foldr (||) False (map ((==) Pos Zero :% Neg (Succ wv44)) wv47)) wv48",fontsize=16,color="burlywood",shape="box"];4329[label="wv46/Succ wv460",fontsize=10,color="white",style="solid",shape="box"];2863 -> 4329[label="",style="solid", color="burlywood", weight=9];
4329 -> 2958[label="",style="solid", color="burlywood", weight=3];
4330[label="wv46/Zero",fontsize=10,color="white",style="solid",shape="box"];2863 -> 4330[label="",style="solid", color="burlywood", weight=9];
4330 -> 2959[label="",style="solid", color="burlywood", weight=3];
2864[label="(++) intersectBy000 (Pos Zero :% Neg (Succ wv44)) ((||) primEqNat Zero wv46 foldr (||) False (map ((==) Pos Zero :% Neg (Succ wv44)) wv47)) wv48",fontsize=16,color="burlywood",shape="box"];4331[label="wv46/Succ wv460",fontsize=10,color="white",style="solid",shape="box"];2864 -> 4331[label="",style="solid", color="burlywood", weight=9];
4331 -> 2960[label="",style="solid", color="burlywood", weight=3];
4332[label="wv46/Zero",fontsize=10,color="white",style="solid",shape="box"];2864 -> 4332[label="",style="solid", color="burlywood", weight=9];
4332 -> 2961[label="",style="solid", color="burlywood", weight=3];
329[label="(++) (Pos Zero :% Neg Zero : []) wv5",fontsize=16,color="black",shape="box"];329 -> 394[label="",style="solid", color="black", weight=3];
2642[label="(++) intersectBy000 (Neg (Succ wv24) :% Pos (Succ wv2500)) ((||) primEqInt (Pos (Succ wv2500)) (Pos wv280) foldr (||) False (map ((==) Neg (Succ wv24) :% Pos (Succ wv2500)) wv29)) wv30",fontsize=16,color="burlywood",shape="box"];4333[label="wv280/Succ wv2800",fontsize=10,color="white",style="solid",shape="box"];2642 -> 4333[label="",style="solid", color="burlywood", weight=9];
4333 -> 2683[label="",style="solid", color="burlywood", weight=3];
4334[label="wv280/Zero",fontsize=10,color="white",style="solid",shape="box"];2642 -> 4334[label="",style="solid", color="burlywood", weight=9];
4334 -> 2684[label="",style="solid", color="burlywood", weight=3];
2643[label="(++) intersectBy000 (Neg (Succ wv24) :% Pos (Succ wv2500)) ((||) primEqInt (Pos (Succ wv2500)) (Neg wv280) foldr (||) False (map ((==) Neg (Succ wv24) :% Pos (Succ wv2500)) wv29)) wv30",fontsize=16,color="black",shape="box"];2643 -> 2685[label="",style="solid", color="black", weight=3];
2644[label="(++) intersectBy000 (Neg (Succ wv24) :% Pos Zero) ((||) primEqInt (Pos Zero) (Pos wv280) foldr (||) False (map ((==) Neg (Succ wv24) :% Pos Zero) wv29)) wv30",fontsize=16,color="burlywood",shape="box"];4335[label="wv280/Succ wv2800",fontsize=10,color="white",style="solid",shape="box"];2644 -> 4335[label="",style="solid", color="burlywood", weight=9];
4335 -> 2686[label="",style="solid", color="burlywood", weight=3];
4336[label="wv280/Zero",fontsize=10,color="white",style="solid",shape="box"];2644 -> 4336[label="",style="solid", color="burlywood", weight=9];
4336 -> 2687[label="",style="solid", color="burlywood", weight=3];
2645[label="(++) intersectBy000 (Neg (Succ wv24) :% Pos Zero) ((||) primEqInt (Pos Zero) (Neg wv280) foldr (||) False (map ((==) Neg (Succ wv24) :% Pos Zero) wv29)) wv30",fontsize=16,color="burlywood",shape="box"];4337[label="wv280/Succ wv2800",fontsize=10,color="white",style="solid",shape="box"];2645 -> 4337[label="",style="solid", color="burlywood", weight=9];
4337 -> 2688[label="",style="solid", color="burlywood", weight=3];
4338[label="wv280/Zero",fontsize=10,color="white",style="solid",shape="box"];2645 -> 4338[label="",style="solid", color="burlywood", weight=9];
4338 -> 2689[label="",style="solid", color="burlywood", weight=3];
2646[label="(++) intersectBy000 (Neg (Succ wv24) :% Neg (Succ wv2500)) ((||) primEqInt (Neg (Succ wv2500)) (Pos wv280) foldr (||) False (map ((==) Neg (Succ wv24) :% Neg (Succ wv2500)) wv29)) wv30",fontsize=16,color="black",shape="box"];2646 -> 2690[label="",style="solid", color="black", weight=3];
2647[label="(++) intersectBy000 (Neg (Succ wv24) :% Neg (Succ wv2500)) ((||) primEqInt (Neg (Succ wv2500)) (Neg wv280) foldr (||) False (map ((==) Neg (Succ wv24) :% Neg (Succ wv2500)) wv29)) wv30",fontsize=16,color="burlywood",shape="box"];4339[label="wv280/Succ wv2800",fontsize=10,color="white",style="solid",shape="box"];2647 -> 4339[label="",style="solid", color="burlywood", weight=9];
4339 -> 2691[label="",style="solid", color="burlywood", weight=3];
4340[label="wv280/Zero",fontsize=10,color="white",style="solid",shape="box"];2647 -> 4340[label="",style="solid", color="burlywood", weight=9];
4340 -> 2692[label="",style="solid", color="burlywood", weight=3];
2648[label="(++) intersectBy000 (Neg (Succ wv24) :% Neg Zero) ((||) primEqInt (Neg Zero) (Pos wv280) foldr (||) False (map ((==) Neg (Succ wv24) :% Neg Zero) wv29)) wv30",fontsize=16,color="burlywood",shape="box"];4341[label="wv280/Succ wv2800",fontsize=10,color="white",style="solid",shape="box"];2648 -> 4341[label="",style="solid", color="burlywood", weight=9];
4341 -> 2693[label="",style="solid", color="burlywood", weight=3];
4342[label="wv280/Zero",fontsize=10,color="white",style="solid",shape="box"];2648 -> 4342[label="",style="solid", color="burlywood", weight=9];
4342 -> 2694[label="",style="solid", color="burlywood", weight=3];
2649[label="(++) intersectBy000 (Neg (Succ wv24) :% Neg Zero) ((||) primEqInt (Neg Zero) (Neg wv280) foldr (||) False (map ((==) Neg (Succ wv24) :% Neg Zero) wv29)) wv30",fontsize=16,color="burlywood",shape="box"];4343[label="wv280/Succ wv2800",fontsize=10,color="white",style="solid",shape="box"];2649 -> 4343[label="",style="solid", color="burlywood", weight=9];
4343 -> 2695[label="",style="solid", color="burlywood", weight=3];
4344[label="wv280/Zero",fontsize=10,color="white",style="solid",shape="box"];2649 -> 4344[label="",style="solid", color="burlywood", weight=9];
4344 -> 2696[label="",style="solid", color="burlywood", weight=3];
2956[label="(++) intersectBy000 (Neg Zero :% Pos (Succ wv50)) ((||) primEqNat (Succ wv510) wv52 foldr (||) False (map ((==) Neg Zero :% Pos (Succ wv50)) wv53)) wv54",fontsize=16,color="burlywood",shape="box"];4345[label="wv52/Succ wv520",fontsize=10,color="white",style="solid",shape="box"];2956 -> 4345[label="",style="solid", color="burlywood", weight=9];
4345 -> 3034[label="",style="solid", color="burlywood", weight=3];
4346[label="wv52/Zero",fontsize=10,color="white",style="solid",shape="box"];2956 -> 4346[label="",style="solid", color="burlywood", weight=9];
4346 -> 3035[label="",style="solid", color="burlywood", weight=3];
2957[label="(++) intersectBy000 (Neg Zero :% Pos (Succ wv50)) ((||) primEqNat Zero wv52 foldr (||) False (map ((==) Neg Zero :% Pos (Succ wv50)) wv53)) wv54",fontsize=16,color="burlywood",shape="box"];4347[label="wv52/Succ wv520",fontsize=10,color="white",style="solid",shape="box"];2957 -> 4347[label="",style="solid", color="burlywood", weight=9];
4347 -> 3036[label="",style="solid", color="burlywood", weight=3];
4348[label="wv52/Zero",fontsize=10,color="white",style="solid",shape="box"];2957 -> 4348[label="",style="solid", color="burlywood", weight=9];
4348 -> 3037[label="",style="solid", color="burlywood", weight=3];
354[label="(++) (Neg Zero :% Pos Zero : []) wv5",fontsize=16,color="black",shape="box"];354 -> 424[label="",style="solid", color="black", weight=3];
3032[label="(++) intersectBy000 (Neg Zero :% Neg (Succ wv56)) ((||) primEqNat (Succ wv570) wv58 foldr (||) False (map ((==) Neg Zero :% Neg (Succ wv56)) wv59)) wv60",fontsize=16,color="burlywood",shape="box"];4349[label="wv58/Succ wv580",fontsize=10,color="white",style="solid",shape="box"];3032 -> 4349[label="",style="solid", color="burlywood", weight=9];
4349 -> 3085[label="",style="solid", color="burlywood", weight=3];
4350[label="wv58/Zero",fontsize=10,color="white",style="solid",shape="box"];3032 -> 4350[label="",style="solid", color="burlywood", weight=9];
4350 -> 3086[label="",style="solid", color="burlywood", weight=3];
3033[label="(++) intersectBy000 (Neg Zero :% Neg (Succ wv56)) ((||) primEqNat Zero wv58 foldr (||) False (map ((==) Neg Zero :% Neg (Succ wv56)) wv59)) wv60",fontsize=16,color="burlywood",shape="box"];4351[label="wv58/Succ wv580",fontsize=10,color="white",style="solid",shape="box"];3033 -> 4351[label="",style="solid", color="burlywood", weight=9];
4351 -> 3087[label="",style="solid", color="burlywood", weight=3];
4352[label="wv58/Zero",fontsize=10,color="white",style="solid",shape="box"];3033 -> 4352[label="",style="solid", color="burlywood", weight=9];
4352 -> 3088[label="",style="solid", color="burlywood", weight=3];
359[label="(++) (Neg Zero :% Neg Zero : []) wv5",fontsize=16,color="black",shape="box"];359 -> 429[label="",style="solid", color="black", weight=3];
2650[label="(++) intersectBy000 (Pos (Succ wv16) :% Pos (Succ wv1700)) ((||) primEqInt (Pos (Succ wv1700)) (Pos (Succ wv2000)) foldr (||) False (map ((==) Pos (Succ wv16) :% Pos (Succ wv1700)) wv21)) wv22",fontsize=16,color="black",shape="box"];2650 -> 2697[label="",style="solid", color="black", weight=3];
2651[label="(++) intersectBy000 (Pos (Succ wv16) :% Pos (Succ wv1700)) ((||) primEqInt (Pos (Succ wv1700)) (Pos Zero) foldr (||) False (map ((==) Pos (Succ wv16) :% Pos (Succ wv1700)) wv21)) wv22",fontsize=16,color="black",shape="box"];2651 -> 2698[label="",style="solid", color="black", weight=3];
2652 -> 66[label="",style="dashed", color="red", weight=0];
2652[label="(++) intersectBy000 (Pos (Succ wv16) :% Pos (Succ wv1700)) ((||) False foldr (||) False (map ((==) Pos (Succ wv16) :% Pos (Succ wv1700)) wv21)) wv22",fontsize=16,color="magenta"];2652 -> 2699[label="",style="dashed", color="magenta", weight=3];
2652 -> 2700[label="",style="dashed", color="magenta", weight=3];
2652 -> 2701[label="",style="dashed", color="magenta", weight=3];
2652 -> 2702[label="",style="dashed", color="magenta", weight=3];
2653[label="(++) intersectBy000 (Pos (Succ wv16) :% Pos Zero) ((||) primEqInt (Pos Zero) (Pos (Succ wv2000)) foldr (||) False (map ((==) Pos (Succ wv16) :% Pos Zero) wv21)) wv22",fontsize=16,color="black",shape="box"];2653 -> 2703[label="",style="solid", color="black", weight=3];
2654[label="(++) intersectBy000 (Pos (Succ wv16) :% Pos Zero) ((||) primEqInt (Pos Zero) (Pos Zero) foldr (||) False (map ((==) Pos (Succ wv16) :% Pos Zero) wv21)) wv22",fontsize=16,color="black",shape="box"];2654 -> 2704[label="",style="solid", color="black", weight=3];
2655[label="(++) intersectBy000 (Pos (Succ wv16) :% Pos Zero) ((||) primEqInt (Pos Zero) (Neg (Succ wv2000)) foldr (||) False (map ((==) Pos (Succ wv16) :% Pos Zero) wv21)) wv22",fontsize=16,color="black",shape="box"];2655 -> 2705[label="",style="solid", color="black", weight=3];
2656[label="(++) intersectBy000 (Pos (Succ wv16) :% Pos Zero) ((||) primEqInt (Pos Zero) (Neg Zero) foldr (||) False (map ((==) Pos (Succ wv16) :% Pos Zero) wv21)) wv22",fontsize=16,color="black",shape="box"];2656 -> 2706[label="",style="solid", color="black", weight=3];
2657 -> 66[label="",style="dashed", color="red", weight=0];
2657[label="(++) intersectBy000 (Pos (Succ wv16) :% Neg (Succ wv1700)) ((||) False foldr (||) False (map ((==) Pos (Succ wv16) :% Neg (Succ wv1700)) wv21)) wv22",fontsize=16,color="magenta"];2657 -> 2707[label="",style="dashed", color="magenta", weight=3];
2657 -> 2708[label="",style="dashed", color="magenta", weight=3];
2657 -> 2709[label="",style="dashed", color="magenta", weight=3];
2657 -> 2710[label="",style="dashed", color="magenta", weight=3];
2658[label="(++) intersectBy000 (Pos (Succ wv16) :% Neg (Succ wv1700)) ((||) primEqInt (Neg (Succ wv1700)) (Neg (Succ wv2000)) foldr (||) False (map ((==) Pos (Succ wv16) :% Neg (Succ wv1700)) wv21)) wv22",fontsize=16,color="black",shape="box"];2658 -> 2711[label="",style="solid", color="black", weight=3];
2659[label="(++) intersectBy000 (Pos (Succ wv16) :% Neg (Succ wv1700)) ((||) primEqInt (Neg (Succ wv1700)) (Neg Zero) foldr (||) False (map ((==) Pos (Succ wv16) :% Neg (Succ wv1700)) wv21)) wv22",fontsize=16,color="black",shape="box"];2659 -> 2712[label="",style="solid", color="black", weight=3];
2660[label="(++) intersectBy000 (Pos (Succ wv16) :% Neg Zero) ((||) primEqInt (Neg Zero) (Pos (Succ wv2000)) foldr (||) False (map ((==) Pos (Succ wv16) :% Neg Zero) wv21)) wv22",fontsize=16,color="black",shape="box"];2660 -> 2713[label="",style="solid", color="black", weight=3];
2661[label="(++) intersectBy000 (Pos (Succ wv16) :% Neg Zero) ((||) primEqInt (Neg Zero) (Pos Zero) foldr (||) False (map ((==) Pos (Succ wv16) :% Neg Zero) wv21)) wv22",fontsize=16,color="black",shape="box"];2661 -> 2714[label="",style="solid", color="black", weight=3];
2662[label="(++) intersectBy000 (Pos (Succ wv16) :% Neg Zero) ((||) primEqInt (Neg Zero) (Neg (Succ wv2000)) foldr (||) False (map ((==) Pos (Succ wv16) :% Neg Zero) wv21)) wv22",fontsize=16,color="black",shape="box"];2662 -> 2715[label="",style="solid", color="black", weight=3];
2663[label="(++) intersectBy000 (Pos (Succ wv16) :% Neg Zero) ((||) primEqInt (Neg Zero) (Neg Zero) foldr (||) False (map ((==) Pos (Succ wv16) :% Neg Zero) wv21)) wv22",fontsize=16,color="black",shape="box"];2663 -> 2716[label="",style="solid", color="black", weight=3];
2865[label="(++) intersectBy000 (Pos Zero :% Pos (Succ wv38)) ((||) primEqNat (Succ wv390) (Succ wv400) foldr (||) False (map ((==) Pos Zero :% Pos (Succ wv38)) wv41)) wv42",fontsize=16,color="black",shape="box"];2865 -> 2962[label="",style="solid", color="black", weight=3];
2866[label="(++) intersectBy000 (Pos Zero :% Pos (Succ wv38)) ((||) primEqNat (Succ wv390) Zero foldr (||) False (map ((==) Pos Zero :% Pos (Succ wv38)) wv41)) wv42",fontsize=16,color="black",shape="box"];2866 -> 2963[label="",style="solid", color="black", weight=3];
2867[label="(++) intersectBy000 (Pos Zero :% Pos (Succ wv38)) ((||) primEqNat Zero (Succ wv400) foldr (||) False (map ((==) Pos Zero :% Pos (Succ wv38)) wv41)) wv42",fontsize=16,color="black",shape="box"];2867 -> 2964[label="",style="solid", color="black", weight=3];
2868[label="(++) intersectBy000 (Pos Zero :% Pos (Succ wv38)) ((||) primEqNat Zero Zero foldr (||) False (map ((==) Pos Zero :% Pos (Succ wv38)) wv41)) wv42",fontsize=16,color="black",shape="box"];2868 -> 2965[label="",style="solid", color="black", weight=3];
389[label="Pos Zero :% Pos Zero : [] ++ wv5",fontsize=16,color="green",shape="box"];389 -> 466[label="",style="dashed", color="green", weight=3];
2958[label="(++) intersectBy000 (Pos Zero :% Neg (Succ wv44)) ((||) primEqNat (Succ wv450) (Succ wv460) foldr (||) False (map ((==) Pos Zero :% Neg (Succ wv44)) wv47)) wv48",fontsize=16,color="black",shape="box"];2958 -> 3038[label="",style="solid", color="black", weight=3];
2959[label="(++) intersectBy000 (Pos Zero :% Neg (Succ wv44)) ((||) primEqNat (Succ wv450) Zero foldr (||) False (map ((==) Pos Zero :% Neg (Succ wv44)) wv47)) wv48",fontsize=16,color="black",shape="box"];2959 -> 3039[label="",style="solid", color="black", weight=3];
2960[label="(++) intersectBy000 (Pos Zero :% Neg (Succ wv44)) ((||) primEqNat Zero (Succ wv460) foldr (||) False (map ((==) Pos Zero :% Neg (Succ wv44)) wv47)) wv48",fontsize=16,color="black",shape="box"];2960 -> 3040[label="",style="solid", color="black", weight=3];
2961[label="(++) intersectBy000 (Pos Zero :% Neg (Succ wv44)) ((||) primEqNat Zero Zero foldr (||) False (map ((==) Pos Zero :% Neg (Succ wv44)) wv47)) wv48",fontsize=16,color="black",shape="box"];2961 -> 3041[label="",style="solid", color="black", weight=3];
394[label="Pos Zero :% Neg Zero : [] ++ wv5",fontsize=16,color="green",shape="box"];394 -> 472[label="",style="dashed", color="green", weight=3];
2683[label="(++) intersectBy000 (Neg (Succ wv24) :% Pos (Succ wv2500)) ((||) primEqInt (Pos (Succ wv2500)) (Pos (Succ wv2800)) foldr (||) False (map ((==) Neg (Succ wv24) :% Pos (Succ wv2500)) wv29)) wv30",fontsize=16,color="black",shape="box"];2683 -> 2766[label="",style="solid", color="black", weight=3];
2684[label="(++) intersectBy000 (Neg (Succ wv24) :% Pos (Succ wv2500)) ((||) primEqInt (Pos (Succ wv2500)) (Pos Zero) foldr (||) False (map ((==) Neg (Succ wv24) :% Pos (Succ wv2500)) wv29)) wv30",fontsize=16,color="black",shape="box"];2684 -> 2767[label="",style="solid", color="black", weight=3];
2685 -> 71[label="",style="dashed", color="red", weight=0];
2685[label="(++) intersectBy000 (Neg (Succ wv24) :% Pos (Succ wv2500)) ((||) False foldr (||) False (map ((==) Neg (Succ wv24) :% Pos (Succ wv2500)) wv29)) wv30",fontsize=16,color="magenta"];2685 -> 2768[label="",style="dashed", color="magenta", weight=3];
2685 -> 2769[label="",style="dashed", color="magenta", weight=3];
2685 -> 2770[label="",style="dashed", color="magenta", weight=3];
2685 -> 2771[label="",style="dashed", color="magenta", weight=3];
2686[label="(++) intersectBy000 (Neg (Succ wv24) :% Pos Zero) ((||) primEqInt (Pos Zero) (Pos (Succ wv2800)) foldr (||) False (map ((==) Neg (Succ wv24) :% Pos Zero) wv29)) wv30",fontsize=16,color="black",shape="box"];2686 -> 2772[label="",style="solid", color="black", weight=3];
2687[label="(++) intersectBy000 (Neg (Succ wv24) :% Pos Zero) ((||) primEqInt (Pos Zero) (Pos Zero) foldr (||) False (map ((==) Neg (Succ wv24) :% Pos Zero) wv29)) wv30",fontsize=16,color="black",shape="box"];2687 -> 2773[label="",style="solid", color="black", weight=3];
2688[label="(++) intersectBy000 (Neg (Succ wv24) :% Pos Zero) ((||) primEqInt (Pos Zero) (Neg (Succ wv2800)) foldr (||) False (map ((==) Neg (Succ wv24) :% Pos Zero) wv29)) wv30",fontsize=16,color="black",shape="box"];2688 -> 2774[label="",style="solid", color="black", weight=3];
2689[label="(++) intersectBy000 (Neg (Succ wv24) :% Pos Zero) ((||) primEqInt (Pos Zero) (Neg Zero) foldr (||) False (map ((==) Neg (Succ wv24) :% Pos Zero) wv29)) wv30",fontsize=16,color="black",shape="box"];2689 -> 2775[label="",style="solid", color="black", weight=3];
2690 -> 71[label="",style="dashed", color="red", weight=0];
2690[label="(++) intersectBy000 (Neg (Succ wv24) :% Neg (Succ wv2500)) ((||) False foldr (||) False (map ((==) Neg (Succ wv24) :% Neg (Succ wv2500)) wv29)) wv30",fontsize=16,color="magenta"];2690 -> 2776[label="",style="dashed", color="magenta", weight=3];
2690 -> 2777[label="",style="dashed", color="magenta", weight=3];
2690 -> 2778[label="",style="dashed", color="magenta", weight=3];
2690 -> 2779[label="",style="dashed", color="magenta", weight=3];
2691[label="(++) intersectBy000 (Neg (Succ wv24) :% Neg (Succ wv2500)) ((||) primEqInt (Neg (Succ wv2500)) (Neg (Succ wv2800)) foldr (||) False (map ((==) Neg (Succ wv24) :% Neg (Succ wv2500)) wv29)) wv30",fontsize=16,color="black",shape="box"];2691 -> 2780[label="",style="solid", color="black", weight=3];
2692[label="(++) intersectBy000 (Neg (Succ wv24) :% Neg (Succ wv2500)) ((||) primEqInt (Neg (Succ wv2500)) (Neg Zero) foldr (||) False (map ((==) Neg (Succ wv24) :% Neg (Succ wv2500)) wv29)) wv30",fontsize=16,color="black",shape="box"];2692 -> 2781[label="",style="solid", color="black", weight=3];
2693[label="(++) intersectBy000 (Neg (Succ wv24) :% Neg Zero) ((||) primEqInt (Neg Zero) (Pos (Succ wv2800)) foldr (||) False (map ((==) Neg (Succ wv24) :% Neg Zero) wv29)) wv30",fontsize=16,color="black",shape="box"];2693 -> 2782[label="",style="solid", color="black", weight=3];
2694[label="(++) intersectBy000 (Neg (Succ wv24) :% Neg Zero) ((||) primEqInt (Neg Zero) (Pos Zero) foldr (||) False (map ((==) Neg (Succ wv24) :% Neg Zero) wv29)) wv30",fontsize=16,color="black",shape="box"];2694 -> 2783[label="",style="solid", color="black", weight=3];
2695[label="(++) intersectBy000 (Neg (Succ wv24) :% Neg Zero) ((||) primEqInt (Neg Zero) (Neg (Succ wv2800)) foldr (||) False (map ((==) Neg (Succ wv24) :% Neg Zero) wv29)) wv30",fontsize=16,color="black",shape="box"];2695 -> 2784[label="",style="solid", color="black", weight=3];
2696[label="(++) intersectBy000 (Neg (Succ wv24) :% Neg Zero) ((||) primEqInt (Neg Zero) (Neg Zero) foldr (||) False (map ((==) Neg (Succ wv24) :% Neg Zero) wv29)) wv30",fontsize=16,color="black",shape="box"];2696 -> 2785[label="",style="solid", color="black", weight=3];
3034[label="(++) intersectBy000 (Neg Zero :% Pos (Succ wv50)) ((||) primEqNat (Succ wv510) (Succ wv520) foldr (||) False (map ((==) Neg Zero :% Pos (Succ wv50)) wv53)) wv54",fontsize=16,color="black",shape="box"];3034 -> 3089[label="",style="solid", color="black", weight=3];
3035[label="(++) intersectBy000 (Neg Zero :% Pos (Succ wv50)) ((||) primEqNat (Succ wv510) Zero foldr (||) False (map ((==) Neg Zero :% Pos (Succ wv50)) wv53)) wv54",fontsize=16,color="black",shape="box"];3035 -> 3090[label="",style="solid", color="black", weight=3];
3036[label="(++) intersectBy000 (Neg Zero :% Pos (Succ wv50)) ((||) primEqNat Zero (Succ wv520) foldr (||) False (map ((==) Neg Zero :% Pos (Succ wv50)) wv53)) wv54",fontsize=16,color="black",shape="box"];3036 -> 3091[label="",style="solid", color="black", weight=3];
3037[label="(++) intersectBy000 (Neg Zero :% Pos (Succ wv50)) ((||) primEqNat Zero Zero foldr (||) False (map ((==) Neg Zero :% Pos (Succ wv50)) wv53)) wv54",fontsize=16,color="black",shape="box"];3037 -> 3092[label="",style="solid", color="black", weight=3];
424[label="Neg Zero :% Pos Zero : [] ++ wv5",fontsize=16,color="green",shape="box"];424 -> 509[label="",style="dashed", color="green", weight=3];
3085[label="(++) intersectBy000 (Neg Zero :% Neg (Succ wv56)) ((||) primEqNat (Succ wv570) (Succ wv580) foldr (||) False (map ((==) Neg Zero :% Neg (Succ wv56)) wv59)) wv60",fontsize=16,color="black",shape="box"];3085 -> 3139[label="",style="solid", color="black", weight=3];
3086[label="(++) intersectBy000 (Neg Zero :% Neg (Succ wv56)) ((||) primEqNat (Succ wv570) Zero foldr (||) False (map ((==) Neg Zero :% Neg (Succ wv56)) wv59)) wv60",fontsize=16,color="black",shape="box"];3086 -> 3140[label="",style="solid", color="black", weight=3];
3087[label="(++) intersectBy000 (Neg Zero :% Neg (Succ wv56)) ((||) primEqNat Zero (Succ wv580) foldr (||) False (map ((==) Neg Zero :% Neg (Succ wv56)) wv59)) wv60",fontsize=16,color="black",shape="box"];3087 -> 3141[label="",style="solid", color="black", weight=3];
3088[label="(++) intersectBy000 (Neg Zero :% Neg (Succ wv56)) ((||) primEqNat Zero Zero foldr (||) False (map ((==) Neg Zero :% Neg (Succ wv56)) wv59)) wv60",fontsize=16,color="black",shape="box"];3088 -> 3142[label="",style="solid", color="black", weight=3];
429[label="Neg Zero :% Neg Zero : [] ++ wv5",fontsize=16,color="green",shape="box"];429 -> 515[label="",style="dashed", color="green", weight=3];
2697 -> 3815[label="",style="dashed", color="red", weight=0];
2697[label="(++) intersectBy000 (Pos (Succ wv16) :% Pos (Succ wv1700)) ((||) primEqNat wv1700 wv2000 foldr (||) False (map ((==) Pos (Succ wv16) :% Pos (Succ wv1700)) wv21)) wv22",fontsize=16,color="magenta"];2697 -> 3816[label="",style="dashed", color="magenta", weight=3];
2697 -> 3817[label="",style="dashed", color="magenta", weight=3];
2697 -> 3818[label="",style="dashed", color="magenta", weight=3];
2697 -> 3819[label="",style="dashed", color="magenta", weight=3];
2697 -> 3820[label="",style="dashed", color="magenta", weight=3];
2697 -> 3821[label="",style="dashed", color="magenta", weight=3];
2698 -> 66[label="",style="dashed", color="red", weight=0];
2698[label="(++) intersectBy000 (Pos (Succ wv16) :% Pos (Succ wv1700)) ((||) False foldr (||) False (map ((==) Pos (Succ wv16) :% Pos (Succ wv1700)) wv21)) wv22",fontsize=16,color="magenta"];2698 -> 2788[label="",style="dashed", color="magenta", weight=3];
2698 -> 2789[label="",style="dashed", color="magenta", weight=3];
2698 -> 2790[label="",style="dashed", color="magenta", weight=3];
2698 -> 2791[label="",style="dashed", color="magenta", weight=3];
2699[label="wv16",fontsize=16,color="green",shape="box"];2700[label="Pos (Succ wv1700)",fontsize=16,color="green",shape="box"];2701[label="wv21",fontsize=16,color="green",shape="box"];2702[label="wv22",fontsize=16,color="green",shape="box"];2703 -> 66[label="",style="dashed", color="red", weight=0];
2703[label="(++) intersectBy000 (Pos (Succ wv16) :% Pos Zero) ((||) False foldr (||) False (map ((==) Pos (Succ wv16) :% Pos Zero) wv21)) wv22",fontsize=16,color="magenta"];2703 -> 2792[label="",style="dashed", color="magenta", weight=3];
2703 -> 2793[label="",style="dashed", color="magenta", weight=3];
2703 -> 2794[label="",style="dashed", color="magenta", weight=3];
2703 -> 2795[label="",style="dashed", color="magenta", weight=3];
2704[label="(++) intersectBy000 (Pos (Succ wv16) :% Pos Zero) ((||) True foldr (||) False (map ((==) Pos (Succ wv16) :% Pos Zero) wv21)) wv22",fontsize=16,color="black",shape="triangle"];2704 -> 2796[label="",style="solid", color="black", weight=3];
2705 -> 66[label="",style="dashed", color="red", weight=0];
2705[label="(++) intersectBy000 (Pos (Succ wv16) :% Pos Zero) ((||) False foldr (||) False (map ((==) Pos (Succ wv16) :% Pos Zero) wv21)) wv22",fontsize=16,color="magenta"];2705 -> 2797[label="",style="dashed", color="magenta", weight=3];
2705 -> 2798[label="",style="dashed", color="magenta", weight=3];
2705 -> 2799[label="",style="dashed", color="magenta", weight=3];
2705 -> 2800[label="",style="dashed", color="magenta", weight=3];
2706 -> 2704[label="",style="dashed", color="red", weight=0];
2706[label="(++) intersectBy000 (Pos (Succ wv16) :% Pos Zero) ((||) True foldr (||) False (map ((==) Pos (Succ wv16) :% Pos Zero) wv21)) wv22",fontsize=16,color="magenta"];2707[label="wv16",fontsize=16,color="green",shape="box"];2708[label="Neg (Succ wv1700)",fontsize=16,color="green",shape="box"];2709[label="wv21",fontsize=16,color="green",shape="box"];2710[label="wv22",fontsize=16,color="green",shape="box"];2711 -> 3873[label="",style="dashed", color="red", weight=0];
2711[label="(++) intersectBy000 (Pos (Succ wv16) :% Neg (Succ wv1700)) ((||) primEqNat wv1700 wv2000 foldr (||) False (map ((==) Pos (Succ wv16) :% Neg (Succ wv1700)) wv21)) wv22",fontsize=16,color="magenta"];2711 -> 3874[label="",style="dashed", color="magenta", weight=3];
2711 -> 3875[label="",style="dashed", color="magenta", weight=3];
2711 -> 3876[label="",style="dashed", color="magenta", weight=3];
2711 -> 3877[label="",style="dashed", color="magenta", weight=3];
2711 -> 3878[label="",style="dashed", color="magenta", weight=3];
2711 -> 3879[label="",style="dashed", color="magenta", weight=3];
2712 -> 66[label="",style="dashed", color="red", weight=0];
2712[label="(++) intersectBy000 (Pos (Succ wv16) :% Neg (Succ wv1700)) ((||) False foldr (||) False (map ((==) Pos (Succ wv16) :% Neg (Succ wv1700)) wv21)) wv22",fontsize=16,color="magenta"];2712 -> 2803[label="",style="dashed", color="magenta", weight=3];
2712 -> 2804[label="",style="dashed", color="magenta", weight=3];
2712 -> 2805[label="",style="dashed", color="magenta", weight=3];
2712 -> 2806[label="",style="dashed", color="magenta", weight=3];
2713 -> 66[label="",style="dashed", color="red", weight=0];
2713[label="(++) intersectBy000 (Pos (Succ wv16) :% Neg Zero) ((||) False foldr (||) False (map ((==) Pos (Succ wv16) :% Neg Zero) wv21)) wv22",fontsize=16,color="magenta"];2713 -> 2807[label="",style="dashed", color="magenta", weight=3];
2713 -> 2808[label="",style="dashed", color="magenta", weight=3];
2713 -> 2809[label="",style="dashed", color="magenta", weight=3];
2713 -> 2810[label="",style="dashed", color="magenta", weight=3];
2714[label="(++) intersectBy000 (Pos (Succ wv16) :% Neg Zero) ((||) True foldr (||) False (map ((==) Pos (Succ wv16) :% Neg Zero) wv21)) wv22",fontsize=16,color="black",shape="triangle"];2714 -> 2811[label="",style="solid", color="black", weight=3];
2715 -> 66[label="",style="dashed", color="red", weight=0];
2715[label="(++) intersectBy000 (Pos (Succ wv16) :% Neg Zero) ((||) False foldr (||) False (map ((==) Pos (Succ wv16) :% Neg Zero) wv21)) wv22",fontsize=16,color="magenta"];2715 -> 2812[label="",style="dashed", color="magenta", weight=3];
2715 -> 2813[label="",style="dashed", color="magenta", weight=3];
2715 -> 2814[label="",style="dashed", color="magenta", weight=3];
2715 -> 2815[label="",style="dashed", color="magenta", weight=3];
2716 -> 2714[label="",style="dashed", color="red", weight=0];
2716[label="(++) intersectBy000 (Pos (Succ wv16) :% Neg Zero) ((||) True foldr (||) False (map ((==) Pos (Succ wv16) :% Neg Zero) wv21)) wv22",fontsize=16,color="magenta"];2962 -> 2718[label="",style="dashed", color="red", weight=0];
2962[label="(++) intersectBy000 (Pos Zero :% Pos (Succ wv38)) ((||) primEqNat wv390 wv400 foldr (||) False (map ((==) Pos Zero :% Pos (Succ wv38)) wv41)) wv42",fontsize=16,color="magenta"];2962 -> 3042[label="",style="dashed", color="magenta", weight=3];
2962 -> 3043[label="",style="dashed", color="magenta", weight=3];
2963 -> 81[label="",style="dashed", color="red", weight=0];
2963[label="(++) intersectBy000 (Pos Zero :% Pos (Succ wv38)) ((||) False foldr (||) False (map ((==) Pos Zero :% Pos (Succ wv38)) wv41)) wv42",fontsize=16,color="magenta"];2963 -> 3044[label="",style="dashed", color="magenta", weight=3];
2963 -> 3045[label="",style="dashed", color="magenta", weight=3];
2963 -> 3046[label="",style="dashed", color="magenta", weight=3];
2964 -> 81[label="",style="dashed", color="red", weight=0];
2964[label="(++) intersectBy000 (Pos Zero :% Pos (Succ wv38)) ((||) False foldr (||) False (map ((==) Pos Zero :% Pos (Succ wv38)) wv41)) wv42",fontsize=16,color="magenta"];2964 -> 3047[label="",style="dashed", color="magenta", weight=3];
2964 -> 3048[label="",style="dashed", color="magenta", weight=3];
2964 -> 3049[label="",style="dashed", color="magenta", weight=3];
2965[label="(++) intersectBy000 (Pos Zero :% Pos (Succ wv38)) ((||) True foldr (||) False (map ((==) Pos Zero :% Pos (Succ wv38)) wv41)) wv42",fontsize=16,color="black",shape="box"];2965 -> 3050[label="",style="solid", color="black", weight=3];
466 -> 31[label="",style="dashed", color="red", weight=0];
466[label="[] ++ wv5",fontsize=16,color="magenta"];3038 -> 2817[label="",style="dashed", color="red", weight=0];
3038[label="(++) intersectBy000 (Pos Zero :% Neg (Succ wv44)) ((||) primEqNat wv450 wv460 foldr (||) False (map ((==) Pos Zero :% Neg (Succ wv44)) wv47)) wv48",fontsize=16,color="magenta"];3038 -> 3093[label="",style="dashed", color="magenta", weight=3];
3038 -> 3094[label="",style="dashed", color="magenta", weight=3];
3039 -> 81[label="",style="dashed", color="red", weight=0];
3039[label="(++) intersectBy000 (Pos Zero :% Neg (Succ wv44)) ((||) False foldr (||) False (map ((==) Pos Zero :% Neg (Succ wv44)) wv47)) wv48",fontsize=16,color="magenta"];3039 -> 3095[label="",style="dashed", color="magenta", weight=3];
3039 -> 3096[label="",style="dashed", color="magenta", weight=3];
3039 -> 3097[label="",style="dashed", color="magenta", weight=3];
3040 -> 81[label="",style="dashed", color="red", weight=0];
3040[label="(++) intersectBy000 (Pos Zero :% Neg (Succ wv44)) ((||) False foldr (||) False (map ((==) Pos Zero :% Neg (Succ wv44)) wv47)) wv48",fontsize=16,color="magenta"];3040 -> 3098[label="",style="dashed", color="magenta", weight=3];
3040 -> 3099[label="",style="dashed", color="magenta", weight=3];
3040 -> 3100[label="",style="dashed", color="magenta", weight=3];
3041[label="(++) intersectBy000 (Pos Zero :% Neg (Succ wv44)) ((||) True foldr (||) False (map ((==) Pos Zero :% Neg (Succ wv44)) wv47)) wv48",fontsize=16,color="black",shape="box"];3041 -> 3101[label="",style="solid", color="black", weight=3];
472 -> 31[label="",style="dashed", color="red", weight=0];
472[label="[] ++ wv5",fontsize=16,color="magenta"];2766 -> 3935[label="",style="dashed", color="red", weight=0];
2766[label="(++) intersectBy000 (Neg (Succ wv24) :% Pos (Succ wv2500)) ((||) primEqNat wv2500 wv2800 foldr (||) False (map ((==) Neg (Succ wv24) :% Pos (Succ wv2500)) wv29)) wv30",fontsize=16,color="magenta"];2766 -> 3936[label="",style="dashed", color="magenta", weight=3];
2766 -> 3937[label="",style="dashed", color="magenta", weight=3];
2766 -> 3938[label="",style="dashed", color="magenta", weight=3];
2766 -> 3939[label="",style="dashed", color="magenta", weight=3];
2766 -> 3940[label="",style="dashed", color="magenta", weight=3];
2766 -> 3941[label="",style="dashed", color="magenta", weight=3];
2767 -> 71[label="",style="dashed", color="red", weight=0];
2767[label="(++) intersectBy000 (Neg (Succ wv24) :% Pos (Succ wv2500)) ((||) False foldr (||) False (map ((==) Neg (Succ wv24) :% Pos (Succ wv2500)) wv29)) wv30",fontsize=16,color="magenta"];2767 -> 2871[label="",style="dashed", color="magenta", weight=3];
2767 -> 2872[label="",style="dashed", color="magenta", weight=3];
2767 -> 2873[label="",style="dashed", color="magenta", weight=3];
2767 -> 2874[label="",style="dashed", color="magenta", weight=3];
2768[label="wv24",fontsize=16,color="green",shape="box"];2769[label="Pos (Succ wv2500)",fontsize=16,color="green",shape="box"];2770[label="wv29",fontsize=16,color="green",shape="box"];2771[label="wv30",fontsize=16,color="green",shape="box"];2772 -> 71[label="",style="dashed", color="red", weight=0];
2772[label="(++) intersectBy000 (Neg (Succ wv24) :% Pos Zero) ((||) False foldr (||) False (map ((==) Neg (Succ wv24) :% Pos Zero) wv29)) wv30",fontsize=16,color="magenta"];2772 -> 2875[label="",style="dashed", color="magenta", weight=3];
2772 -> 2876[label="",style="dashed", color="magenta", weight=3];
2772 -> 2877[label="",style="dashed", color="magenta", weight=3];
2772 -> 2878[label="",style="dashed", color="magenta", weight=3];
2773[label="(++) intersectBy000 (Neg (Succ wv24) :% Pos Zero) ((||) True foldr (||) False (map ((==) Neg (Succ wv24) :% Pos Zero) wv29)) wv30",fontsize=16,color="black",shape="triangle"];2773 -> 2879[label="",style="solid", color="black", weight=3];
2774 -> 71[label="",style="dashed", color="red", weight=0];
2774[label="(++) intersectBy000 (Neg (Succ wv24) :% Pos Zero) ((||) False foldr (||) False (map ((==) Neg (Succ wv24) :% Pos Zero) wv29)) wv30",fontsize=16,color="magenta"];2774 -> 2880[label="",style="dashed", color="magenta", weight=3];
2774 -> 2881[label="",style="dashed", color="magenta", weight=3];
2774 -> 2882[label="",style="dashed", color="magenta", weight=3];
2774 -> 2883[label="",style="dashed", color="magenta", weight=3];
2775 -> 2773[label="",style="dashed", color="red", weight=0];
2775[label="(++) intersectBy000 (Neg (Succ wv24) :% Pos Zero) ((||) True foldr (||) False (map ((==) Neg (Succ wv24) :% Pos Zero) wv29)) wv30",fontsize=16,color="magenta"];2776[label="wv24",fontsize=16,color="green",shape="box"];2777[label="Neg (Succ wv2500)",fontsize=16,color="green",shape="box"];2778[label="wv29",fontsize=16,color="green",shape="box"];2779[label="wv30",fontsize=16,color="green",shape="box"];2780 -> 4000[label="",style="dashed", color="red", weight=0];
2780[label="(++) intersectBy000 (Neg (Succ wv24) :% Neg (Succ wv2500)) ((||) primEqNat wv2500 wv2800 foldr (||) False (map ((==) Neg (Succ wv24) :% Neg (Succ wv2500)) wv29)) wv30",fontsize=16,color="magenta"];2780 -> 4001[label="",style="dashed", color="magenta", weight=3];
2780 -> 4002[label="",style="dashed", color="magenta", weight=3];
2780 -> 4003[label="",style="dashed", color="magenta", weight=3];
2780 -> 4004[label="",style="dashed", color="magenta", weight=3];
2780 -> 4005[label="",style="dashed", color="magenta", weight=3];
2780 -> 4006[label="",style="dashed", color="magenta", weight=3];
2781 -> 71[label="",style="dashed", color="red", weight=0];
2781[label="(++) intersectBy000 (Neg (Succ wv24) :% Neg (Succ wv2500)) ((||) False foldr (||) False (map ((==) Neg (Succ wv24) :% Neg (Succ wv2500)) wv29)) wv30",fontsize=16,color="magenta"];2781 -> 2886[label="",style="dashed", color="magenta", weight=3];
2781 -> 2887[label="",style="dashed", color="magenta", weight=3];
2781 -> 2888[label="",style="dashed", color="magenta", weight=3];
2781 -> 2889[label="",style="dashed", color="magenta", weight=3];
2782 -> 71[label="",style="dashed", color="red", weight=0];
2782[label="(++) intersectBy000 (Neg (Succ wv24) :% Neg Zero) ((||) False foldr (||) False (map ((==) Neg (Succ wv24) :% Neg Zero) wv29)) wv30",fontsize=16,color="magenta"];2782 -> 2890[label="",style="dashed", color="magenta", weight=3];
2782 -> 2891[label="",style="dashed", color="magenta", weight=3];
2782 -> 2892[label="",style="dashed", color="magenta", weight=3];
2782 -> 2893[label="",style="dashed", color="magenta", weight=3];
2783[label="(++) intersectBy000 (Neg (Succ wv24) :% Neg Zero) ((||) True foldr (||) False (map ((==) Neg (Succ wv24) :% Neg Zero) wv29)) wv30",fontsize=16,color="black",shape="triangle"];2783 -> 2894[label="",style="solid", color="black", weight=3];
2784 -> 71[label="",style="dashed", color="red", weight=0];
2784[label="(++) intersectBy000 (Neg (Succ wv24) :% Neg Zero) ((||) False foldr (||) False (map ((==) Neg (Succ wv24) :% Neg Zero) wv29)) wv30",fontsize=16,color="magenta"];2784 -> 2895[label="",style="dashed", color="magenta", weight=3];
2784 -> 2896[label="",style="dashed", color="magenta", weight=3];
2784 -> 2897[label="",style="dashed", color="magenta", weight=3];
2784 -> 2898[label="",style="dashed", color="magenta", weight=3];
2785 -> 2783[label="",style="dashed", color="red", weight=0];
2785[label="(++) intersectBy000 (Neg (Succ wv24) :% Neg Zero) ((||) True foldr (||) False (map ((==) Neg (Succ wv24) :% Neg Zero) wv29)) wv30",fontsize=16,color="magenta"];3089 -> 2910[label="",style="dashed", color="red", weight=0];
3089[label="(++) intersectBy000 (Neg Zero :% Pos (Succ wv50)) ((||) primEqNat wv510 wv520 foldr (||) False (map ((==) Neg Zero :% Pos (Succ wv50)) wv53)) wv54",fontsize=16,color="magenta"];3089 -> 3143[label="",style="dashed", color="magenta", weight=3];
3089 -> 3144[label="",style="dashed", color="magenta", weight=3];
3090 -> 86[label="",style="dashed", color="red", weight=0];
3090[label="(++) intersectBy000 (Neg Zero :% Pos (Succ wv50)) ((||) False foldr (||) False (map ((==) Neg Zero :% Pos (Succ wv50)) wv53)) wv54",fontsize=16,color="magenta"];3090 -> 3145[label="",style="dashed", color="magenta", weight=3];
3090 -> 3146[label="",style="dashed", color="magenta", weight=3];
3090 -> 3147[label="",style="dashed", color="magenta", weight=3];
3091 -> 86[label="",style="dashed", color="red", weight=0];
3091[label="(++) intersectBy000 (Neg Zero :% Pos (Succ wv50)) ((||) False foldr (||) False (map ((==) Neg Zero :% Pos (Succ wv50)) wv53)) wv54",fontsize=16,color="magenta"];3091 -> 3148[label="",style="dashed", color="magenta", weight=3];
3091 -> 3149[label="",style="dashed", color="magenta", weight=3];
3091 -> 3150[label="",style="dashed", color="magenta", weight=3];
3092[label="(++) intersectBy000 (Neg Zero :% Pos (Succ wv50)) ((||) True foldr (||) False (map ((==) Neg Zero :% Pos (Succ wv50)) wv53)) wv54",fontsize=16,color="black",shape="box"];3092 -> 3151[label="",style="solid", color="black", weight=3];
509 -> 31[label="",style="dashed", color="red", weight=0];
509[label="[] ++ wv5",fontsize=16,color="magenta"];3139 -> 2986[label="",style="dashed", color="red", weight=0];
3139[label="(++) intersectBy000 (Neg Zero :% Neg (Succ wv56)) ((||) primEqNat wv570 wv580 foldr (||) False (map ((==) Neg Zero :% Neg (Succ wv56)) wv59)) wv60",fontsize=16,color="magenta"];3139 -> 3176[label="",style="dashed", color="magenta", weight=3];
3139 -> 3177[label="",style="dashed", color="magenta", weight=3];
3140 -> 86[label="",style="dashed", color="red", weight=0];
3140[label="(++) intersectBy000 (Neg Zero :% Neg (Succ wv56)) ((||) False foldr (||) False (map ((==) Neg Zero :% Neg (Succ wv56)) wv59)) wv60",fontsize=16,color="magenta"];3140 -> 3178[label="",style="dashed", color="magenta", weight=3];
3140 -> 3179[label="",style="dashed", color="magenta", weight=3];
3140 -> 3180[label="",style="dashed", color="magenta", weight=3];
3141 -> 86[label="",style="dashed", color="red", weight=0];
3141[label="(++) intersectBy000 (Neg Zero :% Neg (Succ wv56)) ((||) False foldr (||) False (map ((==) Neg Zero :% Neg (Succ wv56)) wv59)) wv60",fontsize=16,color="magenta"];3141 -> 3181[label="",style="dashed", color="magenta", weight=3];
3141 -> 3182[label="",style="dashed", color="magenta", weight=3];
3141 -> 3183[label="",style="dashed", color="magenta", weight=3];
3142[label="(++) intersectBy000 (Neg Zero :% Neg (Succ wv56)) ((||) True foldr (||) False (map ((==) Neg Zero :% Neg (Succ wv56)) wv59)) wv60",fontsize=16,color="black",shape="box"];3142 -> 3184[label="",style="solid", color="black", weight=3];
515 -> 31[label="",style="dashed", color="red", weight=0];
515[label="[] ++ wv5",fontsize=16,color="magenta"];3816[label="wv22",fontsize=16,color="green",shape="box"];3817[label="wv1700",fontsize=16,color="green",shape="box"];3818[label="wv21",fontsize=16,color="green",shape="box"];3819[label="wv2000",fontsize=16,color="green",shape="box"];3820[label="wv16",fontsize=16,color="green",shape="box"];3821[label="wv1700",fontsize=16,color="green",shape="box"];3815[label="(++) intersectBy000 (Pos (Succ wv74) :% Pos (Succ wv75)) ((||) primEqNat wv76 wv77 foldr (||) False (map ((==) Pos (Succ wv74) :% Pos (Succ wv75)) wv78)) wv79",fontsize=16,color="burlywood",shape="triangle"];4393[label="wv76/Succ wv760",fontsize=10,color="white",style="solid",shape="box"];3815 -> 4393[label="",style="solid", color="burlywood", weight=9];
4393 -> 3870[label="",style="solid", color="burlywood", weight=3];
4394[label="wv76/Zero",fontsize=10,color="white",style="solid",shape="box"];3815 -> 4394[label="",style="solid", color="burlywood", weight=9];
4394 -> 3871[label="",style="solid", color="burlywood", weight=3];
2788[label="wv16",fontsize=16,color="green",shape="box"];2789[label="Pos (Succ wv1700)",fontsize=16,color="green",shape="box"];2790[label="wv21",fontsize=16,color="green",shape="box"];2791[label="wv22",fontsize=16,color="green",shape="box"];2792[label="wv16",fontsize=16,color="green",shape="box"];2793[label="Pos Zero",fontsize=16,color="green",shape="box"];2794[label="wv21",fontsize=16,color="green",shape="box"];2795[label="wv22",fontsize=16,color="green",shape="box"];2796[label="(++) intersectBy000 (Pos (Succ wv16) :% Pos Zero) True wv22",fontsize=16,color="black",shape="box"];2796 -> 2903[label="",style="solid", color="black", weight=3];
2797[label="wv16",fontsize=16,color="green",shape="box"];2798[label="Pos Zero",fontsize=16,color="green",shape="box"];2799[label="wv21",fontsize=16,color="green",shape="box"];2800[label="wv22",fontsize=16,color="green",shape="box"];3874[label="wv21",fontsize=16,color="green",shape="box"];3875[label="wv2000",fontsize=16,color="green",shape="box"];3876[label="wv22",fontsize=16,color="green",shape="box"];3877[label="wv1700",fontsize=16,color="green",shape="box"];3878[label="wv1700",fontsize=16,color="green",shape="box"];3879[label="wv16",fontsize=16,color="green",shape="box"];3873[label="(++) intersectBy000 (Pos (Succ wv81) :% Neg (Succ wv82)) ((||) primEqNat wv83 wv84 foldr (||) False (map ((==) Pos (Succ wv81) :% Neg (Succ wv82)) wv85)) wv86",fontsize=16,color="burlywood",shape="triangle"];4395[label="wv83/Succ wv830",fontsize=10,color="white",style="solid",shape="box"];3873 -> 4395[label="",style="solid", color="burlywood", weight=9];
4395 -> 3928[label="",style="solid", color="burlywood", weight=3];
4396[label="wv83/Zero",fontsize=10,color="white",style="solid",shape="box"];3873 -> 4396[label="",style="solid", color="burlywood", weight=9];
4396 -> 3929[label="",style="solid", color="burlywood", weight=3];
2803[label="wv16",fontsize=16,color="green",shape="box"];2804[label="Neg (Succ wv1700)",fontsize=16,color="green",shape="box"];2805[label="wv21",fontsize=16,color="green",shape="box"];2806[label="wv22",fontsize=16,color="green",shape="box"];2807[label="wv16",fontsize=16,color="green",shape="box"];2808[label="Neg Zero",fontsize=16,color="green",shape="box"];2809[label="wv21",fontsize=16,color="green",shape="box"];2810[label="wv22",fontsize=16,color="green",shape="box"];2811[label="(++) intersectBy000 (Pos (Succ wv16) :% Neg Zero) True wv22",fontsize=16,color="black",shape="box"];2811 -> 2908[label="",style="solid", color="black", weight=3];
2812[label="wv16",fontsize=16,color="green",shape="box"];2813[label="Neg Zero",fontsize=16,color="green",shape="box"];2814[label="wv21",fontsize=16,color="green",shape="box"];2815[label="wv22",fontsize=16,color="green",shape="box"];3042[label="wv400",fontsize=16,color="green",shape="box"];3043[label="wv390",fontsize=16,color="green",shape="box"];3044[label="Pos (Succ wv38)",fontsize=16,color="green",shape="box"];3045[label="wv41",fontsize=16,color="green",shape="box"];3046[label="wv42",fontsize=16,color="green",shape="box"];3047[label="Pos (Succ wv38)",fontsize=16,color="green",shape="box"];3048[label="wv41",fontsize=16,color="green",shape="box"];3049[label="wv42",fontsize=16,color="green",shape="box"];3050[label="(++) intersectBy000 (Pos Zero :% Pos (Succ wv38)) True wv42",fontsize=16,color="black",shape="box"];3050 -> 3102[label="",style="solid", color="black", weight=3];
3093[label="wv460",fontsize=16,color="green",shape="box"];3094[label="wv450",fontsize=16,color="green",shape="box"];3095[label="Neg (Succ wv44)",fontsize=16,color="green",shape="box"];3096[label="wv47",fontsize=16,color="green",shape="box"];3097[label="wv48",fontsize=16,color="green",shape="box"];3098[label="Neg (Succ wv44)",fontsize=16,color="green",shape="box"];3099[label="wv47",fontsize=16,color="green",shape="box"];3100[label="wv48",fontsize=16,color="green",shape="box"];3101[label="(++) intersectBy000 (Pos Zero :% Neg (Succ wv44)) True wv48",fontsize=16,color="black",shape="box"];3101 -> 3152[label="",style="solid", color="black", weight=3];
3936[label="wv2800",fontsize=16,color="green",shape="box"];3937[label="wv24",fontsize=16,color="green",shape="box"];3938[label="wv2500",fontsize=16,color="green",shape="box"];3939[label="wv2500",fontsize=16,color="green",shape="box"];3940[label="wv30",fontsize=16,color="green",shape="box"];3941[label="wv29",fontsize=16,color="green",shape="box"];3935[label="(++) intersectBy000 (Neg (Succ wv88) :% Pos (Succ wv89)) ((||) primEqNat wv90 wv91 foldr (||) False (map ((==) Neg (Succ wv88) :% Pos (Succ wv89)) wv92)) wv93",fontsize=16,color="burlywood",shape="triangle"];4397[label="wv90/Succ wv900",fontsize=10,color="white",style="solid",shape="box"];3935 -> 4397[label="",style="solid", color="burlywood", weight=9];
4397 -> 3990[label="",style="solid", color="burlywood", weight=3];
4398[label="wv90/Zero",fontsize=10,color="white",style="solid",shape="box"];3935 -> 4398[label="",style="solid", color="burlywood", weight=9];
4398 -> 3991[label="",style="solid", color="burlywood", weight=3];
2871[label="wv24",fontsize=16,color="green",shape="box"];2872[label="Pos (Succ wv2500)",fontsize=16,color="green",shape="box"];2873[label="wv29",fontsize=16,color="green",shape="box"];2874[label="wv30",fontsize=16,color="green",shape="box"];2875[label="wv24",fontsize=16,color="green",shape="box"];2876[label="Pos Zero",fontsize=16,color="green",shape="box"];2877[label="wv29",fontsize=16,color="green",shape="box"];2878[label="wv30",fontsize=16,color="green",shape="box"];2879[label="(++) intersectBy000 (Neg (Succ wv24) :% Pos Zero) True wv30",fontsize=16,color="black",shape="box"];2879 -> 2970[label="",style="solid", color="black", weight=3];
2880[label="wv24",fontsize=16,color="green",shape="box"];2881[label="Pos Zero",fontsize=16,color="green",shape="box"];2882[label="wv29",fontsize=16,color="green",shape="box"];2883[label="wv30",fontsize=16,color="green",shape="box"];4001[label="wv30",fontsize=16,color="green",shape="box"];4002[label="wv2500",fontsize=16,color="green",shape="box"];4003[label="wv29",fontsize=16,color="green",shape="box"];4004[label="wv24",fontsize=16,color="green",shape="box"];4005[label="wv2800",fontsize=16,color="green",shape="box"];4006[label="wv2500",fontsize=16,color="green",shape="box"];4000[label="(++) intersectBy000 (Neg (Succ wv95) :% Neg (Succ wv96)) ((||) primEqNat wv97 wv98 foldr (||) False (map ((==) Neg (Succ wv95) :% Neg (Succ wv96)) wv99)) wv100",fontsize=16,color="burlywood",shape="triangle"];4399[label="wv97/Succ wv970",fontsize=10,color="white",style="solid",shape="box"];4000 -> 4399[label="",style="solid", color="burlywood", weight=9];
4399 -> 4055[label="",style="solid", color="burlywood", weight=3];
4400[label="wv97/Zero",fontsize=10,color="white",style="solid",shape="box"];4000 -> 4400[label="",style="solid", color="burlywood", weight=9];
4400 -> 4056[label="",style="solid", color="burlywood", weight=3];
2886[label="wv24",fontsize=16,color="green",shape="box"];2887[label="Neg (Succ wv2500)",fontsize=16,color="green",shape="box"];2888[label="wv29",fontsize=16,color="green",shape="box"];2889[label="wv30",fontsize=16,color="green",shape="box"];2890[label="wv24",fontsize=16,color="green",shape="box"];2891[label="Neg Zero",fontsize=16,color="green",shape="box"];2892[label="wv29",fontsize=16,color="green",shape="box"];2893[label="wv30",fontsize=16,color="green",shape="box"];2894[label="(++) intersectBy000 (Neg (Succ wv24) :% Neg Zero) True wv30",fontsize=16,color="black",shape="box"];2894 -> 2975[label="",style="solid", color="black", weight=3];
2895[label="wv24",fontsize=16,color="green",shape="box"];2896[label="Neg Zero",fontsize=16,color="green",shape="box"];2897[label="wv29",fontsize=16,color="green",shape="box"];2898[label="wv30",fontsize=16,color="green",shape="box"];3143[label="wv510",fontsize=16,color="green",shape="box"];3144[label="wv520",fontsize=16,color="green",shape="box"];3145[label="Pos (Succ wv50)",fontsize=16,color="green",shape="box"];3146[label="wv53",fontsize=16,color="green",shape="box"];3147[label="wv54",fontsize=16,color="green",shape="box"];3148[label="Pos (Succ wv50)",fontsize=16,color="green",shape="box"];3149[label="wv53",fontsize=16,color="green",shape="box"];3150[label="wv54",fontsize=16,color="green",shape="box"];3151[label="(++) intersectBy000 (Neg Zero :% Pos (Succ wv50)) True wv54",fontsize=16,color="black",shape="box"];3151 -> 3185[label="",style="solid", color="black", weight=3];
3176[label="wv570",fontsize=16,color="green",shape="box"];3177[label="wv580",fontsize=16,color="green",shape="box"];3178[label="Neg (Succ wv56)",fontsize=16,color="green",shape="box"];3179[label="wv59",fontsize=16,color="green",shape="box"];3180[label="wv60",fontsize=16,color="green",shape="box"];3181[label="Neg (Succ wv56)",fontsize=16,color="green",shape="box"];3182[label="wv59",fontsize=16,color="green",shape="box"];3183[label="wv60",fontsize=16,color="green",shape="box"];3184[label="(++) intersectBy000 (Neg Zero :% Neg (Succ wv56)) True wv60",fontsize=16,color="black",shape="box"];3184 -> 3222[label="",style="solid", color="black", weight=3];
3870[label="(++) intersectBy000 (Pos (Succ wv74) :% Pos (Succ wv75)) ((||) primEqNat (Succ wv760) wv77 foldr (||) False (map ((==) Pos (Succ wv74) :% Pos (Succ wv75)) wv78)) wv79",fontsize=16,color="burlywood",shape="box"];4401[label="wv77/Succ wv770",fontsize=10,color="white",style="solid",shape="box"];3870 -> 4401[label="",style="solid", color="burlywood", weight=9];
4401 -> 3930[label="",style="solid", color="burlywood", weight=3];
4402[label="wv77/Zero",fontsize=10,color="white",style="solid",shape="box"];3870 -> 4402[label="",style="solid", color="burlywood", weight=9];
4402 -> 3931[label="",style="solid", color="burlywood", weight=3];
3871[label="(++) intersectBy000 (Pos (Succ wv74) :% Pos (Succ wv75)) ((||) primEqNat Zero wv77 foldr (||) False (map ((==) Pos (Succ wv74) :% Pos (Succ wv75)) wv78)) wv79",fontsize=16,color="burlywood",shape="box"];4403[label="wv77/Succ wv770",fontsize=10,color="white",style="solid",shape="box"];3871 -> 4403[label="",style="solid", color="burlywood", weight=9];
4403 -> 3932[label="",style="solid", color="burlywood", weight=3];
4404[label="wv77/Zero",fontsize=10,color="white",style="solid",shape="box"];3871 -> 4404[label="",style="solid", color="burlywood", weight=9];
4404 -> 3933[label="",style="solid", color="burlywood", weight=3];
2903[label="(++) (Pos (Succ wv16) :% Pos Zero : []) wv22",fontsize=16,color="black",shape="box"];2903 -> 2980[label="",style="solid", color="black", weight=3];
3928[label="(++) intersectBy000 (Pos (Succ wv81) :% Neg (Succ wv82)) ((||) primEqNat (Succ wv830) wv84 foldr (||) False (map ((==) Pos (Succ wv81) :% Neg (Succ wv82)) wv85)) wv86",fontsize=16,color="burlywood",shape="box"];4405[label="wv84/Succ wv840",fontsize=10,color="white",style="solid",shape="box"];3928 -> 4405[label="",style="solid", color="burlywood", weight=9];
4405 -> 3992[label="",style="solid", color="burlywood", weight=3];
4406[label="wv84/Zero",fontsize=10,color="white",style="solid",shape="box"];3928 -> 4406[label="",style="solid", color="burlywood", weight=9];
4406 -> 3993[label="",style="solid", color="burlywood", weight=3];
3929[label="(++) intersectBy000 (Pos (Succ wv81) :% Neg (Succ wv82)) ((||) primEqNat Zero wv84 foldr (||) False (map ((==) Pos (Succ wv81) :% Neg (Succ wv82)) wv85)) wv86",fontsize=16,color="burlywood",shape="box"];4407[label="wv84/Succ wv840",fontsize=10,color="white",style="solid",shape="box"];3929 -> 4407[label="",style="solid", color="burlywood", weight=9];
4407 -> 3994[label="",style="solid", color="burlywood", weight=3];
4408[label="wv84/Zero",fontsize=10,color="white",style="solid",shape="box"];3929 -> 4408[label="",style="solid", color="burlywood", weight=9];
4408 -> 3995[label="",style="solid", color="burlywood", weight=3];
2908[label="(++) (Pos (Succ wv16) :% Neg Zero : []) wv22",fontsize=16,color="black",shape="box"];2908 -> 2985[label="",style="solid", color="black", weight=3];
3102[label="(++) (Pos Zero :% Pos (Succ wv38) : []) wv42",fontsize=16,color="black",shape="box"];3102 -> 3153[label="",style="solid", color="black", weight=3];
3152[label="(++) (Pos Zero :% Neg (Succ wv44) : []) wv48",fontsize=16,color="black",shape="box"];3152 -> 3186[label="",style="solid", color="black", weight=3];
3990[label="(++) intersectBy000 (Neg (Succ wv88) :% Pos (Succ wv89)) ((||) primEqNat (Succ wv900) wv91 foldr (||) False (map ((==) Neg (Succ wv88) :% Pos (Succ wv89)) wv92)) wv93",fontsize=16,color="burlywood",shape="box"];4409[label="wv91/Succ wv910",fontsize=10,color="white",style="solid",shape="box"];3990 -> 4409[label="",style="solid", color="burlywood", weight=9];
4409 -> 4057[label="",style="solid", color="burlywood", weight=3];
4410[label="wv91/Zero",fontsize=10,color="white",style="solid",shape="box"];3990 -> 4410[label="",style="solid", color="burlywood", weight=9];
4410 -> 4058[label="",style="solid", color="burlywood", weight=3];
3991[label="(++) intersectBy000 (Neg (Succ wv88) :% Pos (Succ wv89)) ((||) primEqNat Zero wv91 foldr (||) False (map ((==) Neg (Succ wv88) :% Pos (Succ wv89)) wv92)) wv93",fontsize=16,color="burlywood",shape="box"];4411[label="wv91/Succ wv910",fontsize=10,color="white",style="solid",shape="box"];3991 -> 4411[label="",style="solid", color="burlywood", weight=9];
4411 -> 4059[label="",style="solid", color="burlywood", weight=3];
4412[label="wv91/Zero",fontsize=10,color="white",style="solid",shape="box"];3991 -> 4412[label="",style="solid", color="burlywood", weight=9];
4412 -> 4060[label="",style="solid", color="burlywood", weight=3];
2970[label="(++) (Neg (Succ wv24) :% Pos Zero : []) wv30",fontsize=16,color="black",shape="box"];2970 -> 3055[label="",style="solid", color="black", weight=3];
4055[label="(++) intersectBy000 (Neg (Succ wv95) :% Neg (Succ wv96)) ((||) primEqNat (Succ wv970) wv98 foldr (||) False (map ((==) Neg (Succ wv95) :% Neg (Succ wv96)) wv99)) wv100",fontsize=16,color="burlywood",shape="box"];4413[label="wv98/Succ wv980",fontsize=10,color="white",style="solid",shape="box"];4055 -> 4413[label="",style="solid", color="burlywood", weight=9];
4413 -> 4076[label="",style="solid", color="burlywood", weight=3];
4414[label="wv98/Zero",fontsize=10,color="white",style="solid",shape="box"];4055 -> 4414[label="",style="solid", color="burlywood", weight=9];
4414 -> 4077[label="",style="solid", color="burlywood", weight=3];
4056[label="(++) intersectBy000 (Neg (Succ wv95) :% Neg (Succ wv96)) ((||) primEqNat Zero wv98 foldr (||) False (map ((==) Neg (Succ wv95) :% Neg (Succ wv96)) wv99)) wv100",fontsize=16,color="burlywood",shape="box"];4415[label="wv98/Succ wv980",fontsize=10,color="white",style="solid",shape="box"];4056 -> 4415[label="",style="solid", color="burlywood", weight=9];
4415 -> 4078[label="",style="solid", color="burlywood", weight=3];
4416[label="wv98/Zero",fontsize=10,color="white",style="solid",shape="box"];4056 -> 4416[label="",style="solid", color="burlywood", weight=9];
4416 -> 4079[label="",style="solid", color="burlywood", weight=3];
2975[label="(++) (Neg (Succ wv24) :% Neg Zero : []) wv30",fontsize=16,color="black",shape="box"];2975 -> 3060[label="",style="solid", color="black", weight=3];
3185[label="(++) (Neg Zero :% Pos (Succ wv50) : []) wv54",fontsize=16,color="black",shape="box"];3185 -> 3223[label="",style="solid", color="black", weight=3];
3222[label="(++) (Neg Zero :% Neg (Succ wv56) : []) wv60",fontsize=16,color="black",shape="box"];3222 -> 3262[label="",style="solid", color="black", weight=3];
3930[label="(++) intersectBy000 (Pos (Succ wv74) :% Pos (Succ wv75)) ((||) primEqNat (Succ wv760) (Succ wv770) foldr (||) False (map ((==) Pos (Succ wv74) :% Pos (Succ wv75)) wv78)) wv79",fontsize=16,color="black",shape="box"];3930 -> 3996[label="",style="solid", color="black", weight=3];
3931[label="(++) intersectBy000 (Pos (Succ wv74) :% Pos (Succ wv75)) ((||) primEqNat (Succ wv760) Zero foldr (||) False (map ((==) Pos (Succ wv74) :% Pos (Succ wv75)) wv78)) wv79",fontsize=16,color="black",shape="box"];3931 -> 3997[label="",style="solid", color="black", weight=3];
3932[label="(++) intersectBy000 (Pos (Succ wv74) :% Pos (Succ wv75)) ((||) primEqNat Zero (Succ wv770) foldr (||) False (map ((==) Pos (Succ wv74) :% Pos (Succ wv75)) wv78)) wv79",fontsize=16,color="black",shape="box"];3932 -> 3998[label="",style="solid", color="black", weight=3];
3933[label="(++) intersectBy000 (Pos (Succ wv74) :% Pos (Succ wv75)) ((||) primEqNat Zero Zero foldr (||) False (map ((==) Pos (Succ wv74) :% Pos (Succ wv75)) wv78)) wv79",fontsize=16,color="black",shape="box"];3933 -> 3999[label="",style="solid", color="black", weight=3];
2980[label="Pos (Succ wv16) :% Pos Zero : [] ++ wv22",fontsize=16,color="green",shape="box"];2980 -> 3072[label="",style="dashed", color="green", weight=3];
3992[label="(++) intersectBy000 (Pos (Succ wv81) :% Neg (Succ wv82)) ((||) primEqNat (Succ wv830) (Succ wv840) foldr (||) False (map ((==) Pos (Succ wv81) :% Neg (Succ wv82)) wv85)) wv86",fontsize=16,color="black",shape="box"];3992 -> 4061[label="",style="solid", color="black", weight=3];
3993[label="(++) intersectBy000 (Pos (Succ wv81) :% Neg (Succ wv82)) ((||) primEqNat (Succ wv830) Zero foldr (||) False (map ((==) Pos (Succ wv81) :% Neg (Succ wv82)) wv85)) wv86",fontsize=16,color="black",shape="box"];3993 -> 4062[label="",style="solid", color="black", weight=3];
3994[label="(++) intersectBy000 (Pos (Succ wv81) :% Neg (Succ wv82)) ((||) primEqNat Zero (Succ wv840) foldr (||) False (map ((==) Pos (Succ wv81) :% Neg (Succ wv82)) wv85)) wv86",fontsize=16,color="black",shape="box"];3994 -> 4063[label="",style="solid", color="black", weight=3];
3995[label="(++) intersectBy000 (Pos (Succ wv81) :% Neg (Succ wv82)) ((||) primEqNat Zero Zero foldr (||) False (map ((==) Pos (Succ wv81) :% Neg (Succ wv82)) wv85)) wv86",fontsize=16,color="black",shape="box"];3995 -> 4064[label="",style="solid", color="black", weight=3];
2985[label="Pos (Succ wv16) :% Neg Zero : [] ++ wv22",fontsize=16,color="green",shape="box"];2985 -> 3084[label="",style="dashed", color="green", weight=3];
3153[label="Pos Zero :% Pos (Succ wv38) : [] ++ wv42",fontsize=16,color="green",shape="box"];3153 -> 3187[label="",style="dashed", color="green", weight=3];
3186[label="Pos Zero :% Neg (Succ wv44) : [] ++ wv48",fontsize=16,color="green",shape="box"];3186 -> 3224[label="",style="dashed", color="green", weight=3];
4057[label="(++) intersectBy000 (Neg (Succ wv88) :% Pos (Succ wv89)) ((||) primEqNat (Succ wv900) (Succ wv910) foldr (||) False (map ((==) Neg (Succ wv88) :% Pos (Succ wv89)) wv92)) wv93",fontsize=16,color="black",shape="box"];4057 -> 4080[label="",style="solid", color="black", weight=3];
4058[label="(++) intersectBy000 (Neg (Succ wv88) :% Pos (Succ wv89)) ((||) primEqNat (Succ wv900) Zero foldr (||) False (map ((==) Neg (Succ wv88) :% Pos (Succ wv89)) wv92)) wv93",fontsize=16,color="black",shape="box"];4058 -> 4081[label="",style="solid", color="black", weight=3];
4059[label="(++) intersectBy000 (Neg (Succ wv88) :% Pos (Succ wv89)) ((||) primEqNat Zero (Succ wv910) foldr (||) False (map ((==) Neg (Succ wv88) :% Pos (Succ wv89)) wv92)) wv93",fontsize=16,color="black",shape="box"];4059 -> 4082[label="",style="solid", color="black", weight=3];
4060[label="(++) intersectBy000 (Neg (Succ wv88) :% Pos (Succ wv89)) ((||) primEqNat Zero Zero foldr (||) False (map ((==) Neg (Succ wv88) :% Pos (Succ wv89)) wv92)) wv93",fontsize=16,color="black",shape="box"];4060 -> 4083[label="",style="solid", color="black", weight=3];
3055[label="Neg (Succ wv24) :% Pos Zero : [] ++ wv30",fontsize=16,color="green",shape="box"];3055 -> 3114[label="",style="dashed", color="green", weight=3];
4076[label="(++) intersectBy000 (Neg (Succ wv95) :% Neg (Succ wv96)) ((||) primEqNat (Succ wv970) (Succ wv980) foldr (||) False (map ((==) Neg (Succ wv95) :% Neg (Succ wv96)) wv99)) wv100",fontsize=16,color="black",shape="box"];4076 -> 4096[label="",style="solid", color="black", weight=3];
4077[label="(++) intersectBy000 (Neg (Succ wv95) :% Neg (Succ wv96)) ((||) primEqNat (Succ wv970) Zero foldr (||) False (map ((==) Neg (Succ wv95) :% Neg (Succ wv96)) wv99)) wv100",fontsize=16,color="black",shape="box"];4077 -> 4097[label="",style="solid", color="black", weight=3];
4078[label="(++) intersectBy000 (Neg (Succ wv95) :% Neg (Succ wv96)) ((||) primEqNat Zero (Succ wv980) foldr (||) False (map ((==) Neg (Succ wv95) :% Neg (Succ wv96)) wv99)) wv100",fontsize=16,color="black",shape="box"];4078 -> 4098[label="",style="solid", color="black", weight=3];
4079[label="(++) intersectBy000 (Neg (Succ wv95) :% Neg (Succ wv96)) ((||) primEqNat Zero Zero foldr (||) False (map ((==) Neg (Succ wv95) :% Neg (Succ wv96)) wv99)) wv100",fontsize=16,color="black",shape="box"];4079 -> 4099[label="",style="solid", color="black", weight=3];
3060[label="Neg (Succ wv24) :% Neg Zero : [] ++ wv30",fontsize=16,color="green",shape="box"];3060 -> 3126[label="",style="dashed", color="green", weight=3];
3223[label="Neg Zero :% Pos (Succ wv50) : [] ++ wv54",fontsize=16,color="green",shape="box"];3223 -> 3263[label="",style="dashed", color="green", weight=3];
3262[label="Neg Zero :% Neg (Succ wv56) : [] ++ wv60",fontsize=16,color="green",shape="box"];3262 -> 3287[label="",style="dashed", color="green", weight=3];
3996 -> 3815[label="",style="dashed", color="red", weight=0];
3996[label="(++) intersectBy000 (Pos (Succ wv74) :% Pos (Succ wv75)) ((||) primEqNat wv760 wv770 foldr (||) False (map ((==) Pos (Succ wv74) :% Pos (Succ wv75)) wv78)) wv79",fontsize=16,color="magenta"];3996 -> 4065[label="",style="dashed", color="magenta", weight=3];
3996 -> 4066[label="",style="dashed", color="magenta", weight=3];
3997 -> 66[label="",style="dashed", color="red", weight=0];
3997[label="(++) intersectBy000 (Pos (Succ wv74) :% Pos (Succ wv75)) ((||) False foldr (||) False (map ((==) Pos (Succ wv74) :% Pos (Succ wv75)) wv78)) wv79",fontsize=16,color="magenta"];3997 -> 4067[label="",style="dashed", color="magenta", weight=3];
3997 -> 4068[label="",style="dashed", color="magenta", weight=3];
3997 -> 4069[label="",style="dashed", color="magenta", weight=3];
3997 -> 4070[label="",style="dashed", color="magenta", weight=3];
3998 -> 66[label="",style="dashed", color="red", weight=0];
3998[label="(++) intersectBy000 (Pos (Succ wv74) :% Pos (Succ wv75)) ((||) False foldr (||) False (map ((==) Pos (Succ wv74) :% Pos (Succ wv75)) wv78)) wv79",fontsize=16,color="magenta"];3998 -> 4071[label="",style="dashed", color="magenta", weight=3];
3998 -> 4072[label="",style="dashed", color="magenta", weight=3];
3998 -> 4073[label="",style="dashed", color="magenta", weight=3];
3998 -> 4074[label="",style="dashed", color="magenta", weight=3];
3999[label="(++) intersectBy000 (Pos (Succ wv74) :% Pos (Succ wv75)) ((||) True foldr (||) False (map ((==) Pos (Succ wv74) :% Pos (Succ wv75)) wv78)) wv79",fontsize=16,color="black",shape="box"];3999 -> 4075[label="",style="solid", color="black", weight=3];
3072 -> 31[label="",style="dashed", color="red", weight=0];
3072[label="[] ++ wv22",fontsize=16,color="magenta"];3072 -> 3132[label="",style="dashed", color="magenta", weight=3];
4061 -> 3873[label="",style="dashed", color="red", weight=0];
4061[label="(++) intersectBy000 (Pos (Succ wv81) :% Neg (Succ wv82)) ((||) primEqNat wv830 wv840 foldr (||) False (map ((==) Pos (Succ wv81) :% Neg (Succ wv82)) wv85)) wv86",fontsize=16,color="magenta"];4061 -> 4084[label="",style="dashed", color="magenta", weight=3];
4061 -> 4085[label="",style="dashed", color="magenta", weight=3];
4062 -> 66[label="",style="dashed", color="red", weight=0];
4062[label="(++) intersectBy000 (Pos (Succ wv81) :% Neg (Succ wv82)) ((||) False foldr (||) False (map ((==) Pos (Succ wv81) :% Neg (Succ wv82)) wv85)) wv86",fontsize=16,color="magenta"];4062 -> 4086[label="",style="dashed", color="magenta", weight=3];
4062 -> 4087[label="",style="dashed", color="magenta", weight=3];
4062 -> 4088[label="",style="dashed", color="magenta", weight=3];
4062 -> 4089[label="",style="dashed", color="magenta", weight=3];
4063 -> 66[label="",style="dashed", color="red", weight=0];
4063[label="(++) intersectBy000 (Pos (Succ wv81) :% Neg (Succ wv82)) ((||) False foldr (||) False (map ((==) Pos (Succ wv81) :% Neg (Succ wv82)) wv85)) wv86",fontsize=16,color="magenta"];4063 -> 4090[label="",style="dashed", color="magenta", weight=3];
4063 -> 4091[label="",style="dashed", color="magenta", weight=3];
4063 -> 4092[label="",style="dashed", color="magenta", weight=3];
4063 -> 4093[label="",style="dashed", color="magenta", weight=3];
4064[label="(++) intersectBy000 (Pos (Succ wv81) :% Neg (Succ wv82)) ((||) True foldr (||) False (map ((==) Pos (Succ wv81) :% Neg (Succ wv82)) wv85)) wv86",fontsize=16,color="black",shape="box"];4064 -> 4094[label="",style="solid", color="black", weight=3];
3084 -> 31[label="",style="dashed", color="red", weight=0];
3084[label="[] ++ wv22",fontsize=16,color="magenta"];3084 -> 3138[label="",style="dashed", color="magenta", weight=3];
3187 -> 31[label="",style="dashed", color="red", weight=0];
3187[label="[] ++ wv42",fontsize=16,color="magenta"];3187 -> 3225[label="",style="dashed", color="magenta", weight=3];
3224 -> 31[label="",style="dashed", color="red", weight=0];
3224[label="[] ++ wv48",fontsize=16,color="magenta"];3224 -> 3264[label="",style="dashed", color="magenta", weight=3];
4080 -> 3935[label="",style="dashed", color="red", weight=0];
4080[label="(++) intersectBy000 (Neg (Succ wv88) :% Pos (Succ wv89)) ((||) primEqNat wv900 wv910 foldr (||) False (map ((==) Neg (Succ wv88) :% Pos (Succ wv89)) wv92)) wv93",fontsize=16,color="magenta"];4080 -> 4100[label="",style="dashed", color="magenta", weight=3];
4080 -> 4101[label="",style="dashed", color="magenta", weight=3];
4081 -> 71[label="",style="dashed", color="red", weight=0];
4081[label="(++) intersectBy000 (Neg (Succ wv88) :% Pos (Succ wv89)) ((||) False foldr (||) False (map ((==) Neg (Succ wv88) :% Pos (Succ wv89)) wv92)) wv93",fontsize=16,color="magenta"];4081 -> 4102[label="",style="dashed", color="magenta", weight=3];
4081 -> 4103[label="",style="dashed", color="magenta", weight=3];
4081 -> 4104[label="",style="dashed", color="magenta", weight=3];
4081 -> 4105[label="",style="dashed", color="magenta", weight=3];
4082 -> 71[label="",style="dashed", color="red", weight=0];
4082[label="(++) intersectBy000 (Neg (Succ wv88) :% Pos (Succ wv89)) ((||) False foldr (||) False (map ((==) Neg (Succ wv88) :% Pos (Succ wv89)) wv92)) wv93",fontsize=16,color="magenta"];4082 -> 4106[label="",style="dashed", color="magenta", weight=3];
4082 -> 4107[label="",style="dashed", color="magenta", weight=3];
4082 -> 4108[label="",style="dashed", color="magenta", weight=3];
4082 -> 4109[label="",style="dashed", color="magenta", weight=3];
4083[label="(++) intersectBy000 (Neg (Succ wv88) :% Pos (Succ wv89)) ((||) True foldr (||) False (map ((==) Neg (Succ wv88) :% Pos (Succ wv89)) wv92)) wv93",fontsize=16,color="black",shape="box"];4083 -> 4110[label="",style="solid", color="black", weight=3];
3114 -> 31[label="",style="dashed", color="red", weight=0];
3114[label="[] ++ wv30",fontsize=16,color="magenta"];3114 -> 3159[label="",style="dashed", color="magenta", weight=3];
4096 -> 4000[label="",style="dashed", color="red", weight=0];
4096[label="(++) intersectBy000 (Neg (Succ wv95) :% Neg (Succ wv96)) ((||) primEqNat wv970 wv980 foldr (||) False (map ((==) Neg (Succ wv95) :% Neg (Succ wv96)) wv99)) wv100",fontsize=16,color="magenta"];4096 -> 4113[label="",style="dashed", color="magenta", weight=3];
4096 -> 4114[label="",style="dashed", color="magenta", weight=3];
4097 -> 71[label="",style="dashed", color="red", weight=0];
4097[label="(++) intersectBy000 (Neg (Succ wv95) :% Neg (Succ wv96)) ((||) False foldr (||) False (map ((==) Neg (Succ wv95) :% Neg (Succ wv96)) wv99)) wv100",fontsize=16,color="magenta"];4097 -> 4115[label="",style="dashed", color="magenta", weight=3];
4097 -> 4116[label="",style="dashed", color="magenta", weight=3];
4097 -> 4117[label="",style="dashed", color="magenta", weight=3];
4097 -> 4118[label="",style="dashed", color="magenta", weight=3];
4098 -> 71[label="",style="dashed", color="red", weight=0];
4098[label="(++) intersectBy000 (Neg (Succ wv95) :% Neg (Succ wv96)) ((||) False foldr (||) False (map ((==) Neg (Succ wv95) :% Neg (Succ wv96)) wv99)) wv100",fontsize=16,color="magenta"];4098 -> 4119[label="",style="dashed", color="magenta", weight=3];
4098 -> 4120[label="",style="dashed", color="magenta", weight=3];
4098 -> 4121[label="",style="dashed", color="magenta", weight=3];
4098 -> 4122[label="",style="dashed", color="magenta", weight=3];
4099[label="(++) intersectBy000 (Neg (Succ wv95) :% Neg (Succ wv96)) ((||) True foldr (||) False (map ((==) Neg (Succ wv95) :% Neg (Succ wv96)) wv99)) wv100",fontsize=16,color="black",shape="box"];4099 -> 4123[label="",style="solid", color="black", weight=3];
3126 -> 31[label="",style="dashed", color="red", weight=0];
3126[label="[] ++ wv30",fontsize=16,color="magenta"];3126 -> 3165[label="",style="dashed", color="magenta", weight=3];
3263 -> 31[label="",style="dashed", color="red", weight=0];
3263[label="[] ++ wv54",fontsize=16,color="magenta"];3263 -> 3288[label="",style="dashed", color="magenta", weight=3];
3287 -> 31[label="",style="dashed", color="red", weight=0];
3287[label="[] ++ wv60",fontsize=16,color="magenta"];3287 -> 3323[label="",style="dashed", color="magenta", weight=3];
4065[label="wv770",fontsize=16,color="green",shape="box"];4066[label="wv760",fontsize=16,color="green",shape="box"];4067[label="wv74",fontsize=16,color="green",shape="box"];4068[label="Pos (Succ wv75)",fontsize=16,color="green",shape="box"];4069[label="wv78",fontsize=16,color="green",shape="box"];4070[label="wv79",fontsize=16,color="green",shape="box"];4071[label="wv74",fontsize=16,color="green",shape="box"];4072[label="Pos (Succ wv75)",fontsize=16,color="green",shape="box"];4073[label="wv78",fontsize=16,color="green",shape="box"];4074[label="wv79",fontsize=16,color="green",shape="box"];4075[label="(++) intersectBy000 (Pos (Succ wv74) :% Pos (Succ wv75)) True wv79",fontsize=16,color="black",shape="box"];4075 -> 4095[label="",style="solid", color="black", weight=3];
3132[label="wv22",fontsize=16,color="green",shape="box"];4084[label="wv840",fontsize=16,color="green",shape="box"];4085[label="wv830",fontsize=16,color="green",shape="box"];4086[label="wv81",fontsize=16,color="green",shape="box"];4087[label="Neg (Succ wv82)",fontsize=16,color="green",shape="box"];4088[label="wv85",fontsize=16,color="green",shape="box"];4089[label="wv86",fontsize=16,color="green",shape="box"];4090[label="wv81",fontsize=16,color="green",shape="box"];4091[label="Neg (Succ wv82)",fontsize=16,color="green",shape="box"];4092[label="wv85",fontsize=16,color="green",shape="box"];4093[label="wv86",fontsize=16,color="green",shape="box"];4094[label="(++) intersectBy000 (Pos (Succ wv81) :% Neg (Succ wv82)) True wv86",fontsize=16,color="black",shape="box"];4094 -> 4111[label="",style="solid", color="black", weight=3];
3138[label="wv22",fontsize=16,color="green",shape="box"];3225[label="wv42",fontsize=16,color="green",shape="box"];3264[label="wv48",fontsize=16,color="green",shape="box"];4100[label="wv910",fontsize=16,color="green",shape="box"];4101[label="wv900",fontsize=16,color="green",shape="box"];4102[label="wv88",fontsize=16,color="green",shape="box"];4103[label="Pos (Succ wv89)",fontsize=16,color="green",shape="box"];4104[label="wv92",fontsize=16,color="green",shape="box"];4105[label="wv93",fontsize=16,color="green",shape="box"];4106[label="wv88",fontsize=16,color="green",shape="box"];4107[label="Pos (Succ wv89)",fontsize=16,color="green",shape="box"];4108[label="wv92",fontsize=16,color="green",shape="box"];4109[label="wv93",fontsize=16,color="green",shape="box"];4110[label="(++) intersectBy000 (Neg (Succ wv88) :% Pos (Succ wv89)) True wv93",fontsize=16,color="black",shape="box"];4110 -> 4124[label="",style="solid", color="black", weight=3];
3159[label="wv30",fontsize=16,color="green",shape="box"];4113[label="wv980",fontsize=16,color="green",shape="box"];4114[label="wv970",fontsize=16,color="green",shape="box"];4115[label="wv95",fontsize=16,color="green",shape="box"];4116[label="Neg (Succ wv96)",fontsize=16,color="green",shape="box"];4117[label="wv99",fontsize=16,color="green",shape="box"];4118[label="wv100",fontsize=16,color="green",shape="box"];4119[label="wv95",fontsize=16,color="green",shape="box"];4120[label="Neg (Succ wv96)",fontsize=16,color="green",shape="box"];4121[label="wv99",fontsize=16,color="green",shape="box"];4122[label="wv100",fontsize=16,color="green",shape="box"];4123[label="(++) intersectBy000 (Neg (Succ wv95) :% Neg (Succ wv96)) True wv100",fontsize=16,color="black",shape="box"];4123 -> 4127[label="",style="solid", color="black", weight=3];
3165[label="wv30",fontsize=16,color="green",shape="box"];3288[label="wv54",fontsize=16,color="green",shape="box"];3323[label="wv60",fontsize=16,color="green",shape="box"];4095[label="(++) (Pos (Succ wv74) :% Pos (Succ wv75) : []) wv79",fontsize=16,color="black",shape="box"];4095 -> 4112[label="",style="solid", color="black", weight=3];
4111[label="(++) (Pos (Succ wv81) :% Neg (Succ wv82) : []) wv86",fontsize=16,color="black",shape="box"];4111 -> 4125[label="",style="solid", color="black", weight=3];
4124[label="(++) (Neg (Succ wv88) :% Pos (Succ wv89) : []) wv93",fontsize=16,color="black",shape="box"];4124 -> 4128[label="",style="solid", color="black", weight=3];
4127[label="(++) (Neg (Succ wv95) :% Neg (Succ wv96) : []) wv100",fontsize=16,color="black",shape="box"];4127 -> 4131[label="",style="solid", color="black", weight=3];
4112[label="Pos (Succ wv74) :% Pos (Succ wv75) : [] ++ wv79",fontsize=16,color="green",shape="box"];4112 -> 4126[label="",style="dashed", color="green", weight=3];
4125[label="Pos (Succ wv81) :% Neg (Succ wv82) : [] ++ wv86",fontsize=16,color="green",shape="box"];4125 -> 4129[label="",style="dashed", color="green", weight=3];
4128[label="Neg (Succ wv88) :% Pos (Succ wv89) : [] ++ wv93",fontsize=16,color="green",shape="box"];4128 -> 4132[label="",style="dashed", color="green", weight=3];
4131[label="Neg (Succ wv95) :% Neg (Succ wv96) : [] ++ wv100",fontsize=16,color="green",shape="box"];4131 -> 4134[label="",style="dashed", color="green", weight=3];
4126 -> 31[label="",style="dashed", color="red", weight=0];
4126[label="[] ++ wv79",fontsize=16,color="magenta"];4126 -> 4130[label="",style="dashed", color="magenta", weight=3];
4129 -> 31[label="",style="dashed", color="red", weight=0];
4129[label="[] ++ wv86",fontsize=16,color="magenta"];4129 -> 4133[label="",style="dashed", color="magenta", weight=3];
4132 -> 31[label="",style="dashed", color="red", weight=0];
4132[label="[] ++ wv93",fontsize=16,color="magenta"];4132 -> 4135[label="",style="dashed", color="magenta", weight=3];
4134 -> 31[label="",style="dashed", color="red", weight=0];
4134[label="[] ++ wv100",fontsize=16,color="magenta"];4134 -> 4136[label="",style="dashed", color="magenta", weight=3];
4130[label="wv79",fontsize=16,color="green",shape="box"];4133[label="wv86",fontsize=16,color="green",shape="box"];4135[label="wv93",fontsize=16,color="green",shape="box"];4136[label="wv100",fontsize=16,color="green",shape="box"];}

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                            ↳ DependencyGraphProof

                          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

new_psPs16(Neg(Succ(wv30100)), Neg(Succ(wv40100)), wv41, wv5) → new_psPs14(wv30100, wv30100, wv40100, wv41, wv5)
new_psPs16(Neg(Succ(wv30100)), Pos(wv4010), wv41, wv5) → new_psPs13(Neg(Succ(wv30100)), wv41, wv5)
new_psPs4(:%(Neg(Zero), Neg(Succ(wv30100))), :(:%(Pos(Zero), Pos(wv4010)), wv41), wv5) → new_psPs13(Neg(Succ(wv30100)), wv41, wv5)
new_psPs(wv16, Pos(Succ(wv1700)), Zero, Zero, Neg(wv200), wv21, wv22) → new_psPs2(wv16, Pos(Succ(wv1700)), wv21, wv22)
new_psPs4(:%(Pos(Succ(wv30000)), wv301), :(:%(Pos(Succ(wv40000)), wv401), wv41), wv5) → new_psPs(wv30000, wv301, wv30000, wv40000, wv401, wv41, wv5)
new_psPs4(:%(Neg(Zero), Pos(Succ(wv30100))), :(:%(Pos(Zero), Neg(wv4010)), wv41), wv5) → new_psPs13(Pos(Succ(wv30100)), wv41, wv5)
new_psPs16(Neg(Succ(wv30100)), Neg(Zero), wv41, wv5) → new_psPs13(Neg(Succ(wv30100)), wv41, wv5)
new_psPs4(:%(Pos(Zero), Pos(Succ(wv30100))), :(:%(Pos(Zero), Pos(Succ(wv40100))), wv41), wv5) → new_psPs5(wv30100, wv30100, wv40100, wv41, wv5)
new_psPs4(:%(Pos(Zero), Neg(Succ(wv30100))), :(:%(Pos(Zero), Neg(Succ(wv40100))), wv41), wv5) → new_psPs7(wv30100, wv30100, wv40100, wv41, wv5)
new_psPs10(wv24, Neg(Zero), Zero, Zero, Neg(Succ(wv2800)), wv29, wv30) → new_psPs17(wv24, Neg(Zero), wv29, wv30)
new_psPs10(wv24, Pos(Succ(wv2500)), Zero, Zero, Pos(Zero), wv29, wv30) → new_psPs17(wv24, Pos(Succ(wv2500)), wv29, wv30)
new_psPs9(Neg(Zero), Neg(Succ(wv40100)), wv41, wv5) → new_psPs6(Neg(Zero), wv41, wv5)
new_psPs17(wv30000, wv301, wv41, wv5) → new_psPs4(:%(Neg(Succ(wv30000)), wv301), wv41, wv5)
new_psPs4(:%(Neg(Zero), Pos(Succ(wv30100))), :(:%(Pos(Zero), Pos(Succ(wv40100))), wv41), wv5) → new_psPs12(wv30100, wv30100, wv40100, wv41, wv5)
new_psPs4(:%(Pos(Zero), wv301), :(:%(Neg(Succ(wv40000)), wv401), wv41), wv5) → new_psPs8(wv301, wv401, wv41, wv5)
new_psPs4(:%(Neg(Zero), Pos(Zero)), :(:%(Pos(Zero), Pos(Succ(wv40100))), wv41), wv5) → new_psPs13(Pos(Zero), wv41, wv5)
new_psPs8(wv301, wv401, wv41, wv5) → new_psPs4(:%(Pos(Zero), wv301), wv41, wv5)
new_psPs(wv16, Pos(Zero), Zero, Zero, Pos(Succ(wv2000)), wv21, wv22) → new_psPs2(wv16, Pos(Zero), wv21, wv22)
new_psPs4(:%(Neg(Zero), wv301), :(:%(Neg(Zero), wv401), wv41), wv5) → new_psPs16(wv301, wv401, wv41, wv5)
new_psPs10(wv24, Pos(Succ(wv2500)), Zero, Zero, Neg(wv280), wv29, wv30) → new_psPs17(wv24, Pos(Succ(wv2500)), wv29, wv30)
new_psPs9(Neg(Succ(wv30100)), Neg(Zero), wv41, wv5) → new_psPs6(Neg(Succ(wv30100)), wv41, wv5)
new_psPs7(wv44, Succ(wv450), Succ(wv460), wv47, wv48) → new_psPs7(wv44, wv450, wv460, wv47, wv48)
new_psPs10(wv24, Pos(Zero), Zero, Zero, Pos(Succ(wv2800)), wv29, wv30) → new_psPs17(wv24, Pos(Zero), wv29, wv30)
new_psPs9(Pos(Succ(wv30100)), Pos(Succ(wv40100)), wv41, wv5) → new_psPs5(wv30100, wv30100, wv40100, wv41, wv5)
new_psPs11(wv30000, wv301, wv401, wv41, wv5) → new_psPs4(:%(Neg(Succ(wv30000)), wv301), wv41, wv5)
new_psPs16(Neg(Zero), Pos(Succ(wv40100)), wv41, wv5) → new_psPs13(Neg(Zero), wv41, wv5)
new_psPs10(wv24, Pos(Zero), Zero, Zero, Neg(Succ(wv2800)), wv29, wv30) → new_psPs17(wv24, Pos(Zero), wv29, wv30)
new_psPs18(wv88, wv89, Zero, Succ(wv910), wv92, wv93) → new_psPs17(wv88, Pos(Succ(wv89)), wv92, wv93)
new_psPs18(wv88, wv89, Succ(wv900), Zero, wv92, wv93) → new_psPs17(wv88, Pos(Succ(wv89)), wv92, wv93)
new_psPs4(:%(Pos(Zero), Pos(Zero)), :(:%(Pos(Zero), Neg(Succ(wv40100))), wv41), wv5) → new_psPs6(Pos(Zero), wv41, wv5)
new_psPs6(wv301, wv41, wv5) → new_psPs4(:%(Pos(Zero), wv301), wv41, wv5)
new_psPs9(Pos(Succ(wv30100)), Neg(wv4010), wv41, wv5) → new_psPs6(Pos(Succ(wv30100)), wv41, wv5)
new_psPs12(wv50, Succ(wv510), Succ(wv520), wv53, wv54) → new_psPs12(wv50, wv510, wv520, wv53, wv54)
new_psPs10(wv24, Neg(Zero), Zero, Zero, Pos(Succ(wv2800)), wv29, wv30) → new_psPs17(wv24, Neg(Zero), wv29, wv30)
new_psPs10(wv24, wv25, Zero, Succ(wv270), wv28, wv29, wv30) → new_psPs11(wv24, wv25, wv28, wv29, wv30)
new_psPs10(wv24, wv25, Succ(wv260), Zero, wv28, wv29, wv30) → new_psPs11(wv24, wv25, wv28, wv29, wv30)
new_psPs10(wv24, Pos(Succ(wv2500)), Zero, Zero, Pos(Succ(wv2800)), wv29, wv30) → new_psPs18(wv24, wv2500, wv2500, wv2800, wv29, wv30)
new_psPs1(wv74, wv75, Succ(wv760), Succ(wv770), wv78, wv79) → new_psPs1(wv74, wv75, wv760, wv770, wv78, wv79)
new_psPs4(:%(Neg(Zero), Neg(Zero)), :(:%(Pos(Zero), Pos(Succ(wv40100))), wv41), wv5) → new_psPs13(Neg(Zero), wv41, wv5)
new_psPs5(wv38, Zero, Succ(wv400), wv41, wv42) → new_psPs6(Pos(Succ(wv38)), wv41, wv42)
new_psPs5(wv38, Succ(wv390), Zero, wv41, wv42) → new_psPs6(Pos(Succ(wv38)), wv41, wv42)
new_psPs4(:%(Pos(Succ(wv30000)), wv301), :(:%(Neg(wv4000), wv401), wv41), wv5) → new_psPs4(:%(Pos(Succ(wv30000)), wv301), wv41, wv5)
new_psPs4(:%(Neg(Zero), Neg(Zero)), :(:%(Pos(Zero), Neg(Succ(wv40100))), wv41), wv5) → new_psPs13(Neg(Zero), wv41, wv5)
new_psPs4(:%(Neg(Zero), Pos(Zero)), :(:%(Pos(Zero), Neg(Succ(wv40100))), wv41), wv5) → new_psPs13(Pos(Zero), wv41, wv5)
new_psPs18(wv88, wv89, Succ(wv900), Succ(wv910), wv92, wv93) → new_psPs18(wv88, wv89, wv900, wv910, wv92, wv93)
new_psPs(wv16, Pos(Zero), Zero, Zero, Neg(Succ(wv2000)), wv21, wv22) → new_psPs2(wv16, Pos(Zero), wv21, wv22)
new_psPs4(:%(Neg(Zero), wv301), :(:%(Pos(Succ(wv40000)), wv401), wv41), wv5) → new_psPs4(:%(Neg(Zero), wv301), wv41, wv5)
new_psPs4(:%(Pos(Zero), Pos(Succ(wv30100))), :(:%(Pos(Zero), Pos(Zero)), wv41), wv5) → new_psPs6(Pos(Succ(wv30100)), wv41, wv5)
new_psPs4(:%(Neg(Succ(wv30000)), wv301), :(:%(Neg(Succ(wv40000)), wv401), wv41), wv5) → new_psPs10(wv30000, wv301, wv30000, wv40000, wv401, wv41, wv5)
new_psPs4(:%(Pos(Zero), wv301), :(:%(Neg(Zero), wv401), wv41), wv5) → new_psPs9(wv301, wv401, wv41, wv5)
new_psPs9(Pos(Succ(wv30100)), Pos(Zero), wv41, wv5) → new_psPs6(Pos(Succ(wv30100)), wv41, wv5)
new_psPs2(wv30000, wv301, wv41, wv5) → new_psPs4(:%(Pos(Succ(wv30000)), wv301), wv41, wv5)
new_psPs(wv16, Neg(Succ(wv1700)), Zero, Zero, Neg(Zero), wv21, wv22) → new_psPs2(wv16, Neg(Succ(wv1700)), wv21, wv22)
new_psPs4(:%(Pos(Zero), Neg(Zero)), :(:%(Pos(Zero), Pos(Succ(wv40100))), wv41), wv5) → new_psPs6(Neg(Zero), wv41, wv5)
new_psPs(wv16, Neg(Succ(wv1700)), Zero, Zero, Pos(wv200), wv21, wv22) → new_psPs2(wv16, Neg(Succ(wv1700)), wv21, wv22)
new_psPs5(wv38, Succ(wv390), Succ(wv400), wv41, wv42) → new_psPs5(wv38, wv390, wv400, wv41, wv42)
new_psPs4(:%(Pos(Zero), wv301), :(:%(Pos(Succ(wv40000)), wv401), wv41), wv5) → new_psPs4(:%(Pos(Zero), wv301), wv41, wv5)
new_psPs(wv16, Neg(Succ(wv1700)), Zero, Zero, Neg(Succ(wv2000)), wv21, wv22) → new_psPs3(wv16, wv1700, wv1700, wv2000, wv21, wv22)
new_psPs15(wv301, wv401, wv41, wv5) → new_psPs4(:%(Neg(Zero), wv301), wv41, wv5)
new_psPs16(Neg(Zero), Neg(Succ(wv40100)), wv41, wv5) → new_psPs13(Neg(Zero), wv41, wv5)
new_psPs9(Neg(Succ(wv30100)), Neg(Succ(wv40100)), wv41, wv5) → new_psPs7(wv30100, wv30100, wv40100, wv41, wv5)
new_psPs0(wv30000, wv301, wv401, wv41, wv5) → new_psPs4(:%(Pos(Succ(wv30000)), wv301), wv41, wv5)
new_psPs16(Pos(Zero), Neg(Succ(wv40100)), wv41, wv5) → new_psPs13(Pos(Zero), wv41, wv5)
new_psPs9(Neg(Zero), Pos(Succ(wv40100)), wv41, wv5) → new_psPs6(Neg(Zero), wv41, wv5)
new_psPs4(:%(Pos(Zero), Neg(Succ(wv30100))), :(:%(Pos(Zero), Neg(Zero)), wv41), wv5) → new_psPs6(Neg(Succ(wv30100)), wv41, wv5)
new_psPs(wv16, Pos(Succ(wv1700)), Zero, Zero, Pos(Succ(wv2000)), wv21, wv22) → new_psPs1(wv16, wv1700, wv1700, wv2000, wv21, wv22)
new_psPs16(Pos(Succ(wv30100)), Neg(wv4010), wv41, wv5) → new_psPs13(Pos(Succ(wv30100)), wv41, wv5)
new_psPs1(wv74, wv75, Zero, Succ(wv770), wv78, wv79) → new_psPs2(wv74, Pos(Succ(wv75)), wv78, wv79)
new_psPs1(wv74, wv75, Succ(wv760), Zero, wv78, wv79) → new_psPs2(wv74, Pos(Succ(wv75)), wv78, wv79)
new_psPs4(:%(Pos(Succ(wv30000)), wv301), :(:%(Pos(Zero), wv401), wv41), wv5) → new_psPs0(wv30000, wv301, wv401, wv41, wv5)
new_psPs9(Pos(Zero), Neg(Succ(wv40100)), wv41, wv5) → new_psPs6(Pos(Zero), wv41, wv5)
new_psPs9(Neg(Succ(wv30100)), Pos(wv4010), wv41, wv5) → new_psPs6(Neg(Succ(wv30100)), wv41, wv5)
new_psPs14(wv56, Succ(wv570), Succ(wv580), wv59, wv60) → new_psPs14(wv56, wv570, wv580, wv59, wv60)
new_psPs4(:%(Pos(Zero), Pos(Zero)), :(:%(Pos(Zero), Pos(Succ(wv40100))), wv41), wv5) → new_psPs6(Pos(Zero), wv41, wv5)
new_psPs(wv16, wv17, Succ(wv180), Succ(wv190), wv20, wv21, wv22) → new_psPs(wv16, wv17, wv180, wv190, wv20, wv21, wv22)
new_psPs4(:%(Neg(Succ(wv30000)), wv301), :(:%(Pos(wv4000), wv401), wv41), wv5) → new_psPs4(:%(Neg(Succ(wv30000)), wv301), wv41, wv5)
new_psPs10(wv24, wv25, Succ(wv260), Succ(wv270), wv28, wv29, wv30) → new_psPs10(wv24, wv25, wv260, wv270, wv28, wv29, wv30)
new_psPs16(Pos(Succ(wv30100)), Pos(Succ(wv40100)), wv41, wv5) → new_psPs12(wv30100, wv30100, wv40100, wv41, wv5)
new_psPs3(wv81, wv82, Succ(wv830), Succ(wv840), wv85, wv86) → new_psPs3(wv81, wv82, wv830, wv840, wv85, wv86)
new_psPs16(Pos(Zero), Pos(Succ(wv40100)), wv41, wv5) → new_psPs13(Pos(Zero), wv41, wv5)
new_psPs10(wv24, Neg(Succ(wv2500)), Zero, Zero, Pos(wv280), wv29, wv30) → new_psPs17(wv24, Neg(Succ(wv2500)), wv29, wv30)
new_psPs4(:%(Neg(Zero), wv301), :(:%(Neg(Succ(wv40000)), wv401), wv41), wv5) → new_psPs15(wv301, wv401, wv41, wv5)
new_psPs4(:%(Neg(Succ(wv30000)), wv301), :(:%(Neg(Zero), wv401), wv41), wv5) → new_psPs11(wv30000, wv301, wv401, wv41, wv5)
new_psPs4(:%(Neg(Zero), Pos(Succ(wv30100))), :(:%(Pos(Zero), Pos(Zero)), wv41), wv5) → new_psPs13(Pos(Succ(wv30100)), wv41, wv5)
new_psPs10(wv24, Neg(Succ(wv2500)), Zero, Zero, Neg(Zero), wv29, wv30) → new_psPs17(wv24, Neg(Succ(wv2500)), wv29, wv30)
new_psPs(wv16, wv17, Zero, Succ(wv190), wv20, wv21, wv22) → new_psPs0(wv16, wv17, wv20, wv21, wv22)
new_psPs(wv16, wv17, Succ(wv180), Zero, wv20, wv21, wv22) → new_psPs0(wv16, wv17, wv20, wv21, wv22)
new_psPs14(wv56, Zero, Succ(wv580), wv59, wv60) → new_psPs13(Neg(Succ(wv56)), wv59, wv60)
new_psPs14(wv56, Succ(wv570), Zero, wv59, wv60) → new_psPs13(Neg(Succ(wv56)), wv59, wv60)
new_psPs(wv16, Neg(Zero), Zero, Zero, Neg(Succ(wv2000)), wv21, wv22) → new_psPs2(wv16, Neg(Zero), wv21, wv22)
new_psPs4(:%(Pos(Zero), Pos(Succ(wv30100))), :(:%(Pos(Zero), Neg(wv4010)), wv41), wv5) → new_psPs6(Pos(Succ(wv30100)), wv41, wv5)
new_psPs4(:%(Neg(Zero), Neg(Succ(wv30100))), :(:%(Pos(Zero), Neg(Succ(wv40100))), wv41), wv5) → new_psPs14(wv30100, wv30100, wv40100, wv41, wv5)
new_psPs(wv16, Pos(Succ(wv1700)), Zero, Zero, Pos(Zero), wv21, wv22) → new_psPs2(wv16, Pos(Succ(wv1700)), wv21, wv22)
new_psPs19(wv95, wv96, Succ(wv970), Zero, wv99, wv100) → new_psPs17(wv95, Neg(Succ(wv96)), wv99, wv100)
new_psPs19(wv95, wv96, Zero, Succ(wv980), wv99, wv100) → new_psPs17(wv95, Neg(Succ(wv96)), wv99, wv100)
new_psPs4(:%(Pos(Zero), Neg(Succ(wv30100))), :(:%(Pos(Zero), Pos(wv4010)), wv41), wv5) → new_psPs6(Neg(Succ(wv30100)), wv41, wv5)
new_psPs19(wv95, wv96, Succ(wv970), Succ(wv980), wv99, wv100) → new_psPs19(wv95, wv96, wv970, wv980, wv99, wv100)
new_psPs9(Pos(Zero), Pos(Succ(wv40100)), wv41, wv5) → new_psPs6(Pos(Zero), wv41, wv5)
new_psPs4(:%(Pos(Zero), Neg(Zero)), :(:%(Pos(Zero), Neg(Succ(wv40100))), wv41), wv5) → new_psPs6(Neg(Zero), wv41, wv5)
new_psPs12(wv50, Succ(wv510), Zero, wv53, wv54) → new_psPs13(Pos(Succ(wv50)), wv53, wv54)
new_psPs12(wv50, Zero, Succ(wv520), wv53, wv54) → new_psPs13(Pos(Succ(wv50)), wv53, wv54)
new_psPs13(wv301, wv41, wv5) → new_psPs4(:%(Neg(Zero), wv301), wv41, wv5)
new_psPs7(wv44, Zero, Succ(wv460), wv47, wv48) → new_psPs6(Neg(Succ(wv44)), wv47, wv48)
new_psPs7(wv44, Succ(wv450), Zero, wv47, wv48) → new_psPs6(Neg(Succ(wv44)), wv47, wv48)
new_psPs10(wv24, Neg(Succ(wv2500)), Zero, Zero, Neg(Succ(wv2800)), wv29, wv30) → new_psPs19(wv24, wv2500, wv2500, wv2800, wv29, wv30)
new_psPs(wv16, Neg(Zero), Zero, Zero, Pos(Succ(wv2000)), wv21, wv22) → new_psPs2(wv16, Neg(Zero), wv21, wv22)
new_psPs4(:%(Neg(Zero), Neg(Succ(wv30100))), :(:%(Pos(Zero), Neg(Zero)), wv41), wv5) → new_psPs13(Neg(Succ(wv30100)), wv41, wv5)
new_psPs16(Pos(Succ(wv30100)), Pos(Zero), wv41, wv5) → new_psPs13(Pos(Succ(wv30100)), wv41, wv5)
new_psPs3(wv81, wv82, Succ(wv830), Zero, wv85, wv86) → new_psPs2(wv81, Neg(Succ(wv82)), wv85, wv86)
new_psPs3(wv81, wv82, Zero, Succ(wv840), wv85, wv86) → new_psPs2(wv81, Neg(Succ(wv82)), wv85, wv86)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 4 SCCs.

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                  ↳ QDPSizeChangeProof

                                ↳ QDP

                                ↳ QDP

                                ↳ QDP

                          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

new_psPs10(wv24, Neg(Succ(wv2500)), Zero, Zero, Pos(wv280), wv29, wv30) → new_psPs17(wv24, Neg(Succ(wv2500)), wv29, wv30)
new_psPs10(wv24, Pos(Succ(wv2500)), Zero, Zero, Neg(wv280), wv29, wv30) → new_psPs17(wv24, Pos(Succ(wv2500)), wv29, wv30)
new_psPs10(wv24, Pos(Zero), Zero, Zero, Neg(Succ(wv2800)), wv29, wv30) → new_psPs17(wv24, Pos(Zero), wv29, wv30)
new_psPs19(wv95, wv96, Zero, Succ(wv980), wv99, wv100) → new_psPs17(wv95, Neg(Succ(wv96)), wv99, wv100)
new_psPs19(wv95, wv96, Succ(wv970), Zero, wv99, wv100) → new_psPs17(wv95, Neg(Succ(wv96)), wv99, wv100)
new_psPs18(wv88, wv89, Zero, Succ(wv910), wv92, wv93) → new_psPs17(wv88, Pos(Succ(wv89)), wv92, wv93)
new_psPs18(wv88, wv89, Succ(wv900), Zero, wv92, wv93) → new_psPs17(wv88, Pos(Succ(wv89)), wv92, wv93)
new_psPs10(wv24, Pos(Zero), Zero, Zero, Pos(Succ(wv2800)), wv29, wv30) → new_psPs17(wv24, Pos(Zero), wv29, wv30)
new_psPs19(wv95, wv96, Succ(wv970), Succ(wv980), wv99, wv100) → new_psPs19(wv95, wv96, wv970, wv980, wv99, wv100)
new_psPs4(:%(Neg(Succ(wv30000)), wv301), :(:%(Neg(Zero), wv401), wv41), wv5) → new_psPs11(wv30000, wv301, wv401, wv41, wv5)
new_psPs10(wv24, Neg(Succ(wv2500)), Zero, Zero, Neg(Zero), wv29, wv30) → new_psPs17(wv24, Neg(Succ(wv2500)), wv29, wv30)
new_psPs10(wv24, wv25, Succ(wv260), Zero, wv28, wv29, wv30) → new_psPs11(wv24, wv25, wv28, wv29, wv30)
new_psPs10(wv24, wv25, Zero, Succ(wv270), wv28, wv29, wv30) → new_psPs11(wv24, wv25, wv28, wv29, wv30)
new_psPs10(wv24, Neg(Zero), Zero, Zero, Pos(Succ(wv2800)), wv29, wv30) → new_psPs17(wv24, Neg(Zero), wv29, wv30)
new_psPs10(wv24, Pos(Succ(wv2500)), Zero, Zero, Pos(Succ(wv2800)), wv29, wv30) → new_psPs18(wv24, wv2500, wv2500, wv2800, wv29, wv30)
new_psPs10(wv24, Neg(Succ(wv2500)), Zero, Zero, Neg(Succ(wv2800)), wv29, wv30) → new_psPs19(wv24, wv2500, wv2500, wv2800, wv29, wv30)
new_psPs18(wv88, wv89, Succ(wv900), Succ(wv910), wv92, wv93) → new_psPs18(wv88, wv89, wv900, wv910, wv92, wv93)
new_psPs11(wv30000, wv301, wv401, wv41, wv5) → new_psPs4(:%(Neg(Succ(wv30000)), wv301), wv41, wv5)
new_psPs10(wv24, Neg(Zero), Zero, Zero, Neg(Succ(wv2800)), wv29, wv30) → new_psPs17(wv24, Neg(Zero), wv29, wv30)
new_psPs10(wv24, Pos(Succ(wv2500)), Zero, Zero, Pos(Zero), wv29, wv30) → new_psPs17(wv24, Pos(Succ(wv2500)), wv29, wv30)
new_psPs17(wv30000, wv301, wv41, wv5) → new_psPs4(:%(Neg(Succ(wv30000)), wv301), wv41, wv5)
new_psPs4(:%(Neg(Succ(wv30000)), wv301), :(:%(Pos(wv4000), wv401), wv41), wv5) → new_psPs4(:%(Neg(Succ(wv30000)), wv301), wv41, wv5)
new_psPs10(wv24, wv25, Succ(wv260), Succ(wv270), wv28, wv29, wv30) → new_psPs10(wv24, wv25, wv260, wv270, wv28, wv29, wv30)
new_psPs4(:%(Neg(Succ(wv30000)), wv301), :(:%(Neg(Succ(wv40000)), wv401), wv41), wv5) → new_psPs10(wv30000, wv301, wv30000, wv40000, wv401, wv41, wv5)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:

new_psPs4(:%(Neg(Succ(wv30000)), wv301), :(:%(Pos(wv4000), wv401), wv41), wv5) → new_psPs4(:%(Neg(Succ(wv30000)), wv301), wv41, wv5)
The graph contains the following edges 1 >= 1, 2 > 2, 3 >= 3
new_psPs4(:%(Neg(Succ(wv30000)), wv301), :(:%(Neg(Succ(wv40000)), wv401), wv41), wv5) → new_psPs10(wv30000, wv301, wv30000, wv40000, wv401, wv41, wv5)
The graph contains the following edges 1 > 1, 1 > 2, 1 > 3, 2 > 4, 2 > 5, 2 > 6, 3 >= 7
new_psPs4(:%(Neg(Succ(wv30000)), wv301), :(:%(Neg(Zero), wv401), wv41), wv5) → new_psPs11(wv30000, wv301, wv401, wv41, wv5)
The graph contains the following edges 1 > 1, 1 > 2, 2 > 3, 2 > 4, 3 >= 5
new_psPs10(wv24, wv25, Succ(wv260), Succ(wv270), wv28, wv29, wv30) → new_psPs10(wv24, wv25, wv260, wv270, wv28, wv29, wv30)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 > 3, 4 > 4, 5 >= 5, 6 >= 6, 7 >= 7
new_psPs17(wv30000, wv301, wv41, wv5) → new_psPs4(:%(Neg(Succ(wv30000)), wv301), wv41, wv5)
The graph contains the following edges 3 >= 2, 4 >= 3
new_psPs11(wv30000, wv301, wv401, wv41, wv5) → new_psPs4(:%(Neg(Succ(wv30000)), wv301), wv41, wv5)
The graph contains the following edges 4 >= 2, 5 >= 3
new_psPs18(wv88, wv89, Succ(wv900), Succ(wv910), wv92, wv93) → new_psPs18(wv88, wv89, wv900, wv910, wv92, wv93)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 > 3, 4 > 4, 5 >= 5, 6 >= 6
new_psPs19(wv95, wv96, Succ(wv970), Succ(wv980), wv99, wv100) → new_psPs19(wv95, wv96, wv970, wv980, wv99, wv100)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 > 3, 4 > 4, 5 >= 5, 6 >= 6
new_psPs10(wv24, Pos(Succ(wv2500)), Zero, Zero, Pos(Succ(wv2800)), wv29, wv30) → new_psPs18(wv24, wv2500, wv2500, wv2800, wv29, wv30)
The graph contains the following edges 1 >= 1, 2 > 2, 2 > 3, 5 > 4, 6 >= 5, 7 >= 6
new_psPs10(wv24, Neg(Succ(wv2500)), Zero, Zero, Neg(Succ(wv2800)), wv29, wv30) → new_psPs19(wv24, wv2500, wv2500, wv2800, wv29, wv30)
The graph contains the following edges 1 >= 1, 2 > 2, 2 > 3, 5 > 4, 6 >= 5, 7 >= 6
new_psPs10(wv24, Neg(Zero), Zero, Zero, Neg(Succ(wv2800)), wv29, wv30) → new_psPs17(wv24, Neg(Zero), wv29, wv30)
The graph contains the following edges 1 >= 1, 2 >= 2, 6 >= 3, 7 >= 4
new_psPs10(wv24, Pos(Succ(wv2500)), Zero, Zero, Pos(Zero), wv29, wv30) → new_psPs17(wv24, Pos(Succ(wv2500)), wv29, wv30)
The graph contains the following edges 1 >= 1, 2 >= 2, 6 >= 3, 7 >= 4
new_psPs10(wv24, Pos(Succ(wv2500)), Zero, Zero, Neg(wv280), wv29, wv30) → new_psPs17(wv24, Pos(Succ(wv2500)), wv29, wv30)
The graph contains the following edges 1 >= 1, 2 >= 2, 6 >= 3, 7 >= 4
new_psPs10(wv24, Pos(Zero), Zero, Zero, Pos(Succ(wv2800)), wv29, wv30) → new_psPs17(wv24, Pos(Zero), wv29, wv30)
The graph contains the following edges 1 >= 1, 2 >= 2, 6 >= 3, 7 >= 4
new_psPs10(wv24, Pos(Zero), Zero, Zero, Neg(Succ(wv2800)), wv29, wv30) → new_psPs17(wv24, Pos(Zero), wv29, wv30)
The graph contains the following edges 1 >= 1, 2 >= 2, 6 >= 3, 7 >= 4
new_psPs10(wv24, Neg(Zero), Zero, Zero, Pos(Succ(wv2800)), wv29, wv30) → new_psPs17(wv24, Neg(Zero), wv29, wv30)
The graph contains the following edges 1 >= 1, 2 >= 2, 6 >= 3, 7 >= 4
new_psPs10(wv24, Neg(Succ(wv2500)), Zero, Zero, Pos(wv280), wv29, wv30) → new_psPs17(wv24, Neg(Succ(wv2500)), wv29, wv30)
The graph contains the following edges 1 >= 1, 2 >= 2, 6 >= 3, 7 >= 4
new_psPs10(wv24, Neg(Succ(wv2500)), Zero, Zero, Neg(Zero), wv29, wv30) → new_psPs17(wv24, Neg(Succ(wv2500)), wv29, wv30)
The graph contains the following edges 1 >= 1, 2 >= 2, 6 >= 3, 7 >= 4
new_psPs18(wv88, wv89, Succ(wv900), Zero, wv92, wv93) → new_psPs17(wv88, Pos(Succ(wv89)), wv92, wv93)
The graph contains the following edges 1 >= 1, 5 >= 3, 6 >= 4
new_psPs18(wv88, wv89, Zero, Succ(wv910), wv92, wv93) → new_psPs17(wv88, Pos(Succ(wv89)), wv92, wv93)
The graph contains the following edges 1 >= 1, 5 >= 3, 6 >= 4
new_psPs19(wv95, wv96, Succ(wv970), Zero, wv99, wv100) → new_psPs17(wv95, Neg(Succ(wv96)), wv99, wv100)
The graph contains the following edges 1 >= 1, 5 >= 3, 6 >= 4
new_psPs19(wv95, wv96, Zero, Succ(wv980), wv99, wv100) → new_psPs17(wv95, Neg(Succ(wv96)), wv99, wv100)
The graph contains the following edges 1 >= 1, 5 >= 3, 6 >= 4
new_psPs10(wv24, wv25, Succ(wv260), Zero, wv28, wv29, wv30) → new_psPs11(wv24, wv25, wv28, wv29, wv30)
The graph contains the following edges 1 >= 1, 2 >= 2, 5 >= 3, 6 >= 4, 7 >= 5
new_psPs10(wv24, wv25, Zero, Succ(wv270), wv28, wv29, wv30) → new_psPs11(wv24, wv25, wv28, wv29, wv30)
The graph contains the following edges 1 >= 1, 2 >= 2, 5 >= 3, 6 >= 4, 7 >= 5

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                ↳ QDP

                                  ↳ QDPSizeChangeProof

                                ↳ QDP

                                ↳ QDP

                          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

new_psPs9(Pos(Succ(wv30100)), Pos(Zero), wv41, wv5) → new_psPs6(Pos(Succ(wv30100)), wv41, wv5)
new_psPs4(:%(Pos(Zero), Pos(Zero)), :(:%(Pos(Zero), Neg(Succ(wv40100))), wv41), wv5) → new_psPs6(Pos(Zero), wv41, wv5)
new_psPs6(wv301, wv41, wv5) → new_psPs4(:%(Pos(Zero), wv301), wv41, wv5)
new_psPs9(Pos(Succ(wv30100)), Neg(wv4010), wv41, wv5) → new_psPs6(Pos(Succ(wv30100)), wv41, wv5)
new_psPs4(:%(Pos(Zero), Neg(Zero)), :(:%(Pos(Zero), Pos(Succ(wv40100))), wv41), wv5) → new_psPs6(Neg(Zero), wv41, wv5)
new_psPs4(:%(Pos(Zero), Pos(Succ(wv30100))), :(:%(Pos(Zero), Pos(Succ(wv40100))), wv41), wv5) → new_psPs5(wv30100, wv30100, wv40100, wv41, wv5)
new_psPs4(:%(Pos(Zero), Neg(Succ(wv30100))), :(:%(Pos(Zero), Neg(Succ(wv40100))), wv41), wv5) → new_psPs7(wv30100, wv30100, wv40100, wv41, wv5)
new_psPs5(wv38, Succ(wv390), Succ(wv400), wv41, wv42) → new_psPs5(wv38, wv390, wv400, wv41, wv42)
new_psPs9(Neg(Zero), Neg(Succ(wv40100)), wv41, wv5) → new_psPs6(Neg(Zero), wv41, wv5)
new_psPs4(:%(Pos(Zero), wv301), :(:%(Pos(Succ(wv40000)), wv401), wv41), wv5) → new_psPs4(:%(Pos(Zero), wv301), wv41, wv5)
new_psPs4(:%(Pos(Zero), wv301), :(:%(Neg(Succ(wv40000)), wv401), wv41), wv5) → new_psPs8(wv301, wv401, wv41, wv5)
new_psPs8(wv301, wv401, wv41, wv5) → new_psPs4(:%(Pos(Zero), wv301), wv41, wv5)
new_psPs4(:%(Pos(Zero), Pos(Succ(wv30100))), :(:%(Pos(Zero), Neg(wv4010)), wv41), wv5) → new_psPs6(Pos(Succ(wv30100)), wv41, wv5)
new_psPs9(Neg(Succ(wv30100)), Neg(Succ(wv40100)), wv41, wv5) → new_psPs7(wv30100, wv30100, wv40100, wv41, wv5)
new_psPs7(wv44, Succ(wv450), Succ(wv460), wv47, wv48) → new_psPs7(wv44, wv450, wv460, wv47, wv48)
new_psPs9(Neg(Succ(wv30100)), Neg(Zero), wv41, wv5) → new_psPs6(Neg(Succ(wv30100)), wv41, wv5)
new_psPs4(:%(Pos(Zero), Neg(Succ(wv30100))), :(:%(Pos(Zero), Pos(wv4010)), wv41), wv5) → new_psPs6(Neg(Succ(wv30100)), wv41, wv5)
new_psPs9(Neg(Zero), Pos(Succ(wv40100)), wv41, wv5) → new_psPs6(Neg(Zero), wv41, wv5)
new_psPs4(:%(Pos(Zero), Neg(Succ(wv30100))), :(:%(Pos(Zero), Neg(Zero)), wv41), wv5) → new_psPs6(Neg(Succ(wv30100)), wv41, wv5)
new_psPs5(wv38, Zero, Succ(wv400), wv41, wv42) → new_psPs6(Pos(Succ(wv38)), wv41, wv42)
new_psPs5(wv38, Succ(wv390), Zero, wv41, wv42) → new_psPs6(Pos(Succ(wv38)), wv41, wv42)
new_psPs9(Pos(Zero), Pos(Succ(wv40100)), wv41, wv5) → new_psPs6(Pos(Zero), wv41, wv5)
new_psPs4(:%(Pos(Zero), Neg(Zero)), :(:%(Pos(Zero), Neg(Succ(wv40100))), wv41), wv5) → new_psPs6(Neg(Zero), wv41, wv5)
new_psPs7(wv44, Zero, Succ(wv460), wv47, wv48) → new_psPs6(Neg(Succ(wv44)), wv47, wv48)
new_psPs7(wv44, Succ(wv450), Zero, wv47, wv48) → new_psPs6(Neg(Succ(wv44)), wv47, wv48)
new_psPs9(Pos(Succ(wv30100)), Pos(Succ(wv40100)), wv41, wv5) → new_psPs5(wv30100, wv30100, wv40100, wv41, wv5)
new_psPs9(Pos(Zero), Neg(Succ(wv40100)), wv41, wv5) → new_psPs6(Pos(Zero), wv41, wv5)
new_psPs9(Neg(Succ(wv30100)), Pos(wv4010), wv41, wv5) → new_psPs6(Neg(Succ(wv30100)), wv41, wv5)
new_psPs4(:%(Pos(Zero), Pos(Zero)), :(:%(Pos(Zero), Pos(Succ(wv40100))), wv41), wv5) → new_psPs6(Pos(Zero), wv41, wv5)
new_psPs4(:%(Pos(Zero), Pos(Succ(wv30100))), :(:%(Pos(Zero), Pos(Zero)), wv41), wv5) → new_psPs6(Pos(Succ(wv30100)), wv41, wv5)
new_psPs4(:%(Pos(Zero), wv301), :(:%(Neg(Zero), wv401), wv41), wv5) → new_psPs9(wv301, wv401, wv41, wv5)

From the DPs we obtained the following set of size-change graphs:

new_psPs7(wv44, Succ(wv450), Succ(wv460), wv47, wv48) → new_psPs7(wv44, wv450, wv460, wv47, wv48)
The graph contains the following edges 1 >= 1, 2 > 2, 3 > 3, 4 >= 4, 5 >= 5
new_psPs6(wv301, wv41, wv5) → new_psPs4(:%(Pos(Zero), wv301), wv41, wv5)
The graph contains the following edges 2 >= 2, 3 >= 3
new_psPs4(:%(Pos(Zero), Neg(Succ(wv30100))), :(:%(Pos(Zero), Neg(Succ(wv40100))), wv41), wv5) → new_psPs7(wv30100, wv30100, wv40100, wv41, wv5)
The graph contains the following edges 1 > 1, 1 > 2, 2 > 3, 2 > 4, 3 >= 5
new_psPs9(Neg(Succ(wv30100)), Neg(Succ(wv40100)), wv41, wv5) → new_psPs7(wv30100, wv30100, wv40100, wv41, wv5)
The graph contains the following edges 1 > 1, 1 > 2, 2 > 3, 3 >= 4, 4 >= 5
new_psPs4(:%(Pos(Zero), wv301), :(:%(Pos(Succ(wv40000)), wv401), wv41), wv5) → new_psPs4(:%(Pos(Zero), wv301), wv41, wv5)
The graph contains the following edges 1 >= 1, 2 > 2, 3 >= 3
new_psPs8(wv301, wv401, wv41, wv5) → new_psPs4(:%(Pos(Zero), wv301), wv41, wv5)
The graph contains the following edges 3 >= 2, 4 >= 3
new_psPs5(wv38, Succ(wv390), Succ(wv400), wv41, wv42) → new_psPs5(wv38, wv390, wv400, wv41, wv42)
The graph contains the following edges 1 >= 1, 2 > 2, 3 > 3, 4 >= 4, 5 >= 5
new_psPs9(Pos(Succ(wv30100)), Pos(Succ(wv40100)), wv41, wv5) → new_psPs5(wv30100, wv30100, wv40100, wv41, wv5)
The graph contains the following edges 1 > 1, 1 > 2, 2 > 3, 3 >= 4, 4 >= 5
new_psPs4(:%(Pos(Zero), Pos(Succ(wv30100))), :(:%(Pos(Zero), Pos(Succ(wv40100))), wv41), wv5) → new_psPs5(wv30100, wv30100, wv40100, wv41, wv5)
The graph contains the following edges 1 > 1, 1 > 2, 2 > 3, 2 > 4, 3 >= 5
new_psPs4(:%(Pos(Zero), wv301), :(:%(Neg(Succ(wv40000)), wv401), wv41), wv5) → new_psPs8(wv301, wv401, wv41, wv5)
The graph contains the following edges 1 > 1, 2 > 2, 2 > 3, 3 >= 4
new_psPs4(:%(Pos(Zero), wv301), :(:%(Neg(Zero), wv401), wv41), wv5) → new_psPs9(wv301, wv401, wv41, wv5)
The graph contains the following edges 1 > 1, 2 > 2, 2 > 3, 3 >= 4
new_psPs7(wv44, Succ(wv450), Zero, wv47, wv48) → new_psPs6(Neg(Succ(wv44)), wv47, wv48)
The graph contains the following edges 4 >= 2, 5 >= 3
new_psPs7(wv44, Zero, Succ(wv460), wv47, wv48) → new_psPs6(Neg(Succ(wv44)), wv47, wv48)
The graph contains the following edges 4 >= 2, 5 >= 3
new_psPs4(:%(Pos(Zero), Pos(Zero)), :(:%(Pos(Zero), Neg(Succ(wv40100))), wv41), wv5) → new_psPs6(Pos(Zero), wv41, wv5)
The graph contains the following edges 1 > 1, 2 > 1, 2 > 2, 3 >= 3
new_psPs4(:%(Pos(Zero), Pos(Succ(wv30100))), :(:%(Pos(Zero), Pos(Zero)), wv41), wv5) → new_psPs6(Pos(Succ(wv30100)), wv41, wv5)
The graph contains the following edges 1 > 1, 2 > 2, 3 >= 3
new_psPs4(:%(Pos(Zero), Neg(Zero)), :(:%(Pos(Zero), Pos(Succ(wv40100))), wv41), wv5) → new_psPs6(Neg(Zero), wv41, wv5)
The graph contains the following edges 1 > 1, 2 > 2, 3 >= 3
new_psPs4(:%(Pos(Zero), Neg(Succ(wv30100))), :(:%(Pos(Zero), Neg(Zero)), wv41), wv5) → new_psPs6(Neg(Succ(wv30100)), wv41, wv5)
The graph contains the following edges 1 > 1, 2 > 2, 3 >= 3
new_psPs4(:%(Pos(Zero), Pos(Zero)), :(:%(Pos(Zero), Pos(Succ(wv40100))), wv41), wv5) → new_psPs6(Pos(Zero), wv41, wv5)
The graph contains the following edges 1 > 1, 2 > 1, 2 > 2, 3 >= 3
new_psPs4(:%(Pos(Zero), Pos(Succ(wv30100))), :(:%(Pos(Zero), Neg(wv4010)), wv41), wv5) → new_psPs6(Pos(Succ(wv30100)), wv41, wv5)
The graph contains the following edges 1 > 1, 2 > 2, 3 >= 3
new_psPs4(:%(Pos(Zero), Neg(Succ(wv30100))), :(:%(Pos(Zero), Pos(wv4010)), wv41), wv5) → new_psPs6(Neg(Succ(wv30100)), wv41, wv5)
The graph contains the following edges 1 > 1, 2 > 2, 3 >= 3
new_psPs4(:%(Pos(Zero), Neg(Zero)), :(:%(Pos(Zero), Neg(Succ(wv40100))), wv41), wv5) → new_psPs6(Neg(Zero), wv41, wv5)
The graph contains the following edges 1 > 1, 2 > 2, 3 >= 3
new_psPs5(wv38, Succ(wv390), Zero, wv41, wv42) → new_psPs6(Pos(Succ(wv38)), wv41, wv42)
The graph contains the following edges 4 >= 2, 5 >= 3
new_psPs5(wv38, Zero, Succ(wv400), wv41, wv42) → new_psPs6(Pos(Succ(wv38)), wv41, wv42)
The graph contains the following edges 4 >= 2, 5 >= 3
new_psPs9(Neg(Zero), Neg(Succ(wv40100)), wv41, wv5) → new_psPs6(Neg(Zero), wv41, wv5)
The graph contains the following edges 1 >= 1, 3 >= 2, 4 >= 3
new_psPs9(Neg(Succ(wv30100)), Neg(Zero), wv41, wv5) → new_psPs6(Neg(Succ(wv30100)), wv41, wv5)
The graph contains the following edges 1 >= 1, 3 >= 2, 4 >= 3
new_psPs9(Pos(Succ(wv30100)), Neg(wv4010), wv41, wv5) → new_psPs6(Pos(Succ(wv30100)), wv41, wv5)
The graph contains the following edges 1 >= 1, 3 >= 2, 4 >= 3
new_psPs9(Pos(Succ(wv30100)), Pos(Zero), wv41, wv5) → new_psPs6(Pos(Succ(wv30100)), wv41, wv5)
The graph contains the following edges 1 >= 1, 3 >= 2, 4 >= 3
new_psPs9(Neg(Zero), Pos(Succ(wv40100)), wv41, wv5) → new_psPs6(Neg(Zero), wv41, wv5)
The graph contains the following edges 1 >= 1, 3 >= 2, 4 >= 3
new_psPs9(Pos(Zero), Neg(Succ(wv40100)), wv41, wv5) → new_psPs6(Pos(Zero), wv41, wv5)
The graph contains the following edges 1 >= 1, 3 >= 2, 4 >= 3
new_psPs9(Neg(Succ(wv30100)), Pos(wv4010), wv41, wv5) → new_psPs6(Neg(Succ(wv30100)), wv41, wv5)
The graph contains the following edges 1 >= 1, 3 >= 2, 4 >= 3
new_psPs9(Pos(Zero), Pos(Succ(wv40100)), wv41, wv5) → new_psPs6(Pos(Zero), wv41, wv5)
The graph contains the following edges 1 >= 1, 3 >= 2, 4 >= 3

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                ↳ QDP

                                ↳ QDP

                                  ↳ QDPSizeChangeProof

                                ↳ QDP

                          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

new_psPs(wv16, Pos(Succ(wv1700)), Zero, Zero, Neg(wv200), wv21, wv22) → new_psPs2(wv16, Pos(Succ(wv1700)), wv21, wv22)
new_psPs(wv16, Pos(Succ(wv1700)), Zero, Zero, Pos(Zero), wv21, wv22) → new_psPs2(wv16, Pos(Succ(wv1700)), wv21, wv22)
new_psPs0(wv30000, wv301, wv401, wv41, wv5) → new_psPs4(:%(Pos(Succ(wv30000)), wv301), wv41, wv5)
new_psPs4(:%(Pos(Succ(wv30000)), wv301), :(:%(Pos(Succ(wv40000)), wv401), wv41), wv5) → new_psPs(wv30000, wv301, wv30000, wv40000, wv401, wv41, wv5)
new_psPs(wv16, Pos(Succ(wv1700)), Zero, Zero, Pos(Succ(wv2000)), wv21, wv22) → new_psPs1(wv16, wv1700, wv1700, wv2000, wv21, wv22)
new_psPs(wv16, wv17, Succ(wv180), Zero, wv20, wv21, wv22) → new_psPs0(wv16, wv17, wv20, wv21, wv22)
new_psPs4(:%(Pos(Succ(wv30000)), wv301), :(:%(Neg(wv4000), wv401), wv41), wv5) → new_psPs4(:%(Pos(Succ(wv30000)), wv301), wv41, wv5)
new_psPs(wv16, wv17, Zero, Succ(wv190), wv20, wv21, wv22) → new_psPs0(wv16, wv17, wv20, wv21, wv22)
new_psPs2(wv30000, wv301, wv41, wv5) → new_psPs4(:%(Pos(Succ(wv30000)), wv301), wv41, wv5)
new_psPs(wv16, Neg(Succ(wv1700)), Zero, Zero, Neg(Zero), wv21, wv22) → new_psPs2(wv16, Neg(Succ(wv1700)), wv21, wv22)
new_psPs(wv16, Neg(Zero), Zero, Zero, Neg(Succ(wv2000)), wv21, wv22) → new_psPs2(wv16, Neg(Zero), wv21, wv22)
new_psPs(wv16, Neg(Succ(wv1700)), Zero, Zero, Pos(wv200), wv21, wv22) → new_psPs2(wv16, Neg(Succ(wv1700)), wv21, wv22)
new_psPs4(:%(Pos(Succ(wv30000)), wv301), :(:%(Pos(Zero), wv401), wv41), wv5) → new_psPs0(wv30000, wv301, wv401, wv41, wv5)
new_psPs1(wv74, wv75, Succ(wv760), Zero, wv78, wv79) → new_psPs2(wv74, Pos(Succ(wv75)), wv78, wv79)
new_psPs1(wv74, wv75, Zero, Succ(wv770), wv78, wv79) → new_psPs2(wv74, Pos(Succ(wv75)), wv78, wv79)
new_psPs(wv16, Pos(Zero), Zero, Zero, Neg(Succ(wv2000)), wv21, wv22) → new_psPs2(wv16, Pos(Zero), wv21, wv22)
new_psPs(wv16, Neg(Zero), Zero, Zero, Pos(Succ(wv2000)), wv21, wv22) → new_psPs2(wv16, Neg(Zero), wv21, wv22)
new_psPs1(wv74, wv75, Succ(wv760), Succ(wv770), wv78, wv79) → new_psPs1(wv74, wv75, wv760, wv770, wv78, wv79)
new_psPs(wv16, wv17, Succ(wv180), Succ(wv190), wv20, wv21, wv22) → new_psPs(wv16, wv17, wv180, wv190, wv20, wv21, wv22)
new_psPs(wv16, Neg(Succ(wv1700)), Zero, Zero, Neg(Succ(wv2000)), wv21, wv22) → new_psPs3(wv16, wv1700, wv1700, wv2000, wv21, wv22)
new_psPs3(wv81, wv82, Succ(wv830), Succ(wv840), wv85, wv86) → new_psPs3(wv81, wv82, wv830, wv840, wv85, wv86)
new_psPs(wv16, Pos(Zero), Zero, Zero, Pos(Succ(wv2000)), wv21, wv22) → new_psPs2(wv16, Pos(Zero), wv21, wv22)
new_psPs3(wv81, wv82, Zero, Succ(wv840), wv85, wv86) → new_psPs2(wv81, Neg(Succ(wv82)), wv85, wv86)
new_psPs3(wv81, wv82, Succ(wv830), Zero, wv85, wv86) → new_psPs2(wv81, Neg(Succ(wv82)), wv85, wv86)

From the DPs we obtained the following set of size-change graphs:

new_psPs4(:%(Pos(Succ(wv30000)), wv301), :(:%(Neg(wv4000), wv401), wv41), wv5) → new_psPs4(:%(Pos(Succ(wv30000)), wv301), wv41, wv5)
The graph contains the following edges 1 >= 1, 2 > 2, 3 >= 3
new_psPs4(:%(Pos(Succ(wv30000)), wv301), :(:%(Pos(Succ(wv40000)), wv401), wv41), wv5) → new_psPs(wv30000, wv301, wv30000, wv40000, wv401, wv41, wv5)
The graph contains the following edges 1 > 1, 1 > 2, 1 > 3, 2 > 4, 2 > 5, 2 > 6, 3 >= 7
new_psPs4(:%(Pos(Succ(wv30000)), wv301), :(:%(Pos(Zero), wv401), wv41), wv5) → new_psPs0(wv30000, wv301, wv401, wv41, wv5)
The graph contains the following edges 1 > 1, 1 > 2, 2 > 3, 2 > 4, 3 >= 5
new_psPs(wv16, wv17, Succ(wv180), Succ(wv190), wv20, wv21, wv22) → new_psPs(wv16, wv17, wv180, wv190, wv20, wv21, wv22)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 > 3, 4 > 4, 5 >= 5, 6 >= 6, 7 >= 7
new_psPs2(wv30000, wv301, wv41, wv5) → new_psPs4(:%(Pos(Succ(wv30000)), wv301), wv41, wv5)
The graph contains the following edges 3 >= 2, 4 >= 3
new_psPs0(wv30000, wv301, wv401, wv41, wv5) → new_psPs4(:%(Pos(Succ(wv30000)), wv301), wv41, wv5)
The graph contains the following edges 4 >= 2, 5 >= 3
new_psPs3(wv81, wv82, Succ(wv830), Succ(wv840), wv85, wv86) → new_psPs3(wv81, wv82, wv830, wv840, wv85, wv86)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 > 3, 4 > 4, 5 >= 5, 6 >= 6
new_psPs1(wv74, wv75, Succ(wv760), Succ(wv770), wv78, wv79) → new_psPs1(wv74, wv75, wv760, wv770, wv78, wv79)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 > 3, 4 > 4, 5 >= 5, 6 >= 6
new_psPs(wv16, Neg(Succ(wv1700)), Zero, Zero, Neg(Succ(wv2000)), wv21, wv22) → new_psPs3(wv16, wv1700, wv1700, wv2000, wv21, wv22)
The graph contains the following edges 1 >= 1, 2 > 2, 2 > 3, 5 > 4, 6 >= 5, 7 >= 6
new_psPs(wv16, Pos(Succ(wv1700)), Zero, Zero, Pos(Succ(wv2000)), wv21, wv22) → new_psPs1(wv16, wv1700, wv1700, wv2000, wv21, wv22)
The graph contains the following edges 1 >= 1, 2 > 2, 2 > 3, 5 > 4, 6 >= 5, 7 >= 6
new_psPs(wv16, Pos(Succ(wv1700)), Zero, Zero, Neg(wv200), wv21, wv22) → new_psPs2(wv16, Pos(Succ(wv1700)), wv21, wv22)
The graph contains the following edges 1 >= 1, 2 >= 2, 6 >= 3, 7 >= 4
new_psPs(wv16, Pos(Zero), Zero, Zero, Pos(Succ(wv2000)), wv21, wv22) → new_psPs2(wv16, Pos(Zero), wv21, wv22)
The graph contains the following edges 1 >= 1, 2 >= 2, 6 >= 3, 7 >= 4
new_psPs(wv16, Pos(Zero), Zero, Zero, Neg(Succ(wv2000)), wv21, wv22) → new_psPs2(wv16, Pos(Zero), wv21, wv22)
The graph contains the following edges 1 >= 1, 2 >= 2, 6 >= 3, 7 >= 4
new_psPs(wv16, Neg(Succ(wv1700)), Zero, Zero, Neg(Zero), wv21, wv22) → new_psPs2(wv16, Neg(Succ(wv1700)), wv21, wv22)
The graph contains the following edges 1 >= 1, 2 >= 2, 6 >= 3, 7 >= 4
new_psPs(wv16, Neg(Succ(wv1700)), Zero, Zero, Pos(wv200), wv21, wv22) → new_psPs2(wv16, Neg(Succ(wv1700)), wv21, wv22)
The graph contains the following edges 1 >= 1, 2 >= 2, 6 >= 3, 7 >= 4
new_psPs(wv16, Neg(Zero), Zero, Zero, Neg(Succ(wv2000)), wv21, wv22) → new_psPs2(wv16, Neg(Zero), wv21, wv22)
The graph contains the following edges 1 >= 1, 2 >= 2, 6 >= 3, 7 >= 4
new_psPs(wv16, Pos(Succ(wv1700)), Zero, Zero, Pos(Zero), wv21, wv22) → new_psPs2(wv16, Pos(Succ(wv1700)), wv21, wv22)
The graph contains the following edges 1 >= 1, 2 >= 2, 6 >= 3, 7 >= 4
new_psPs(wv16, Neg(Zero), Zero, Zero, Pos(Succ(wv2000)), wv21, wv22) → new_psPs2(wv16, Neg(Zero), wv21, wv22)
The graph contains the following edges 1 >= 1, 2 >= 2, 6 >= 3, 7 >= 4
new_psPs3(wv81, wv82, Zero, Succ(wv840), wv85, wv86) → new_psPs2(wv81, Neg(Succ(wv82)), wv85, wv86)
The graph contains the following edges 1 >= 1, 5 >= 3, 6 >= 4
new_psPs3(wv81, wv82, Succ(wv830), Zero, wv85, wv86) → new_psPs2(wv81, Neg(Succ(wv82)), wv85, wv86)
The graph contains the following edges 1 >= 1, 5 >= 3, 6 >= 4
new_psPs1(wv74, wv75, Zero, Succ(wv770), wv78, wv79) → new_psPs2(wv74, Pos(Succ(wv75)), wv78, wv79)
The graph contains the following edges 1 >= 1, 5 >= 3, 6 >= 4
new_psPs1(wv74, wv75, Succ(wv760), Zero, wv78, wv79) → new_psPs2(wv74, Pos(Succ(wv75)), wv78, wv79)
The graph contains the following edges 1 >= 1, 5 >= 3, 6 >= 4
new_psPs(wv16, wv17, Zero, Succ(wv190), wv20, wv21, wv22) → new_psPs0(wv16, wv17, wv20, wv21, wv22)
The graph contains the following edges 1 >= 1, 2 >= 2, 5 >= 3, 6 >= 4, 7 >= 5
new_psPs(wv16, wv17, Succ(wv180), Zero, wv20, wv21, wv22) → new_psPs0(wv16, wv17, wv20, wv21, wv22)
The graph contains the following edges 1 >= 1, 2 >= 2, 5 >= 3, 6 >= 4, 7 >= 5

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ AND

                                ↳ QDP

                                ↳ QDP

                                ↳ QDP

                                ↳ QDP

                                  ↳ QDPSizeChangeProof

                          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

new_psPs16(Neg(Succ(wv30100)), Neg(Succ(wv40100)), wv41, wv5) → new_psPs14(wv30100, wv30100, wv40100, wv41, wv5)
new_psPs16(Neg(Succ(wv30100)), Pos(wv4010), wv41, wv5) → new_psPs13(Neg(Succ(wv30100)), wv41, wv5)
new_psPs4(:%(Neg(Zero), Neg(Succ(wv30100))), :(:%(Pos(Zero), Pos(wv4010)), wv41), wv5) → new_psPs13(Neg(Succ(wv30100)), wv41, wv5)
new_psPs4(:%(Neg(Zero), wv301), :(:%(Neg(Succ(wv40000)), wv401), wv41), wv5) → new_psPs15(wv301, wv401, wv41, wv5)
new_psPs4(:%(Neg(Zero), Pos(Succ(wv30100))), :(:%(Pos(Zero), Pos(Zero)), wv41), wv5) → new_psPs13(Pos(Succ(wv30100)), wv41, wv5)
new_psPs12(wv50, Succ(wv510), Succ(wv520), wv53, wv54) → new_psPs12(wv50, wv510, wv520, wv53, wv54)
new_psPs4(:%(Neg(Zero), Pos(Succ(wv30100))), :(:%(Pos(Zero), Neg(wv4010)), wv41), wv5) → new_psPs13(Pos(Succ(wv30100)), wv41, wv5)
new_psPs14(wv56, Zero, Succ(wv580), wv59, wv60) → new_psPs13(Neg(Succ(wv56)), wv59, wv60)
new_psPs14(wv56, Succ(wv570), Zero, wv59, wv60) → new_psPs13(Neg(Succ(wv56)), wv59, wv60)
new_psPs16(Neg(Succ(wv30100)), Neg(Zero), wv41, wv5) → new_psPs13(Neg(Succ(wv30100)), wv41, wv5)
new_psPs4(:%(Neg(Zero), Neg(Zero)), :(:%(Pos(Zero), Pos(Succ(wv40100))), wv41), wv5) → new_psPs13(Neg(Zero), wv41, wv5)
new_psPs4(:%(Neg(Zero), Pos(Succ(wv30100))), :(:%(Pos(Zero), Pos(Succ(wv40100))), wv41), wv5) → new_psPs12(wv30100, wv30100, wv40100, wv41, wv5)
new_psPs15(wv301, wv401, wv41, wv5) → new_psPs4(:%(Neg(Zero), wv301), wv41, wv5)
new_psPs4(:%(Neg(Zero), Pos(Zero)), :(:%(Pos(Zero), Pos(Succ(wv40100))), wv41), wv5) → new_psPs13(Pos(Zero), wv41, wv5)
new_psPs4(:%(Neg(Zero), Neg(Succ(wv30100))), :(:%(Pos(Zero), Neg(Succ(wv40100))), wv41), wv5) → new_psPs14(wv30100, wv30100, wv40100, wv41, wv5)
new_psPs4(:%(Neg(Zero), wv301), :(:%(Neg(Zero), wv401), wv41), wv5) → new_psPs16(wv301, wv401, wv41, wv5)
new_psPs16(Neg(Zero), Neg(Succ(wv40100)), wv41, wv5) → new_psPs13(Neg(Zero), wv41, wv5)
new_psPs16(Pos(Zero), Neg(Succ(wv40100)), wv41, wv5) → new_psPs13(Pos(Zero), wv41, wv5)
new_psPs12(wv50, Succ(wv510), Zero, wv53, wv54) → new_psPs13(Pos(Succ(wv50)), wv53, wv54)
new_psPs12(wv50, Zero, Succ(wv520), wv53, wv54) → new_psPs13(Pos(Succ(wv50)), wv53, wv54)
new_psPs16(Pos(Succ(wv30100)), Neg(wv4010), wv41, wv5) → new_psPs13(Pos(Succ(wv30100)), wv41, wv5)
new_psPs4(:%(Neg(Zero), Neg(Zero)), :(:%(Pos(Zero), Neg(Succ(wv40100))), wv41), wv5) → new_psPs13(Neg(Zero), wv41, wv5)
new_psPs4(:%(Neg(Zero), Pos(Zero)), :(:%(Pos(Zero), Neg(Succ(wv40100))), wv41), wv5) → new_psPs13(Pos(Zero), wv41, wv5)
new_psPs13(wv301, wv41, wv5) → new_psPs4(:%(Neg(Zero), wv301), wv41, wv5)
new_psPs4(:%(Neg(Zero), wv301), :(:%(Pos(Succ(wv40000)), wv401), wv41), wv5) → new_psPs4(:%(Neg(Zero), wv301), wv41, wv5)
new_psPs14(wv56, Succ(wv570), Succ(wv580), wv59, wv60) → new_psPs14(wv56, wv570, wv580, wv59, wv60)
new_psPs4(:%(Neg(Zero), Neg(Succ(wv30100))), :(:%(Pos(Zero), Neg(Zero)), wv41), wv5) → new_psPs13(Neg(Succ(wv30100)), wv41, wv5)
new_psPs16(Pos(Succ(wv30100)), Pos(Zero), wv41, wv5) → new_psPs13(Pos(Succ(wv30100)), wv41, wv5)
new_psPs16(Neg(Zero), Pos(Succ(wv40100)), wv41, wv5) → new_psPs13(Neg(Zero), wv41, wv5)
new_psPs16(Pos(Succ(wv30100)), Pos(Succ(wv40100)), wv41, wv5) → new_psPs12(wv30100, wv30100, wv40100, wv41, wv5)
new_psPs16(Pos(Zero), Pos(Succ(wv40100)), wv41, wv5) → new_psPs13(Pos(Zero), wv41, wv5)

From the DPs we obtained the following set of size-change graphs:

new_psPs4(:%(Neg(Zero), wv301), :(:%(Pos(Succ(wv40000)), wv401), wv41), wv5) → new_psPs4(:%(Neg(Zero), wv301), wv41, wv5)
The graph contains the following edges 1 >= 1, 2 > 2, 3 >= 3
new_psPs13(wv301, wv41, wv5) → new_psPs4(:%(Neg(Zero), wv301), wv41, wv5)
The graph contains the following edges 2 >= 2, 3 >= 3
new_psPs15(wv301, wv401, wv41, wv5) → new_psPs4(:%(Neg(Zero), wv301), wv41, wv5)
The graph contains the following edges 3 >= 2, 4 >= 3
new_psPs12(wv50, Succ(wv510), Succ(wv520), wv53, wv54) → new_psPs12(wv50, wv510, wv520, wv53, wv54)
The graph contains the following edges 1 >= 1, 2 > 2, 3 > 3, 4 >= 4, 5 >= 5
new_psPs4(:%(Neg(Zero), Pos(Succ(wv30100))), :(:%(Pos(Zero), Pos(Succ(wv40100))), wv41), wv5) → new_psPs12(wv30100, wv30100, wv40100, wv41, wv5)
The graph contains the following edges 1 > 1, 1 > 2, 2 > 3, 2 > 4, 3 >= 5
new_psPs16(Pos(Succ(wv30100)), Pos(Succ(wv40100)), wv41, wv5) → new_psPs12(wv30100, wv30100, wv40100, wv41, wv5)
The graph contains the following edges 1 > 1, 1 > 2, 2 > 3, 3 >= 4, 4 >= 5
new_psPs16(Neg(Succ(wv30100)), Neg(Succ(wv40100)), wv41, wv5) → new_psPs14(wv30100, wv30100, wv40100, wv41, wv5)
The graph contains the following edges 1 > 1, 1 > 2, 2 > 3, 3 >= 4, 4 >= 5
new_psPs14(wv56, Succ(wv570), Succ(wv580), wv59, wv60) → new_psPs14(wv56, wv570, wv580, wv59, wv60)
The graph contains the following edges 1 >= 1, 2 > 2, 3 > 3, 4 >= 4, 5 >= 5
new_psPs4(:%(Neg(Zero), wv301), :(:%(Neg(Zero), wv401), wv41), wv5) → new_psPs16(wv301, wv401, wv41, wv5)
The graph contains the following edges 1 > 1, 2 > 2, 2 > 3, 3 >= 4
new_psPs4(:%(Neg(Zero), Neg(Succ(wv30100))), :(:%(Pos(Zero), Neg(Succ(wv40100))), wv41), wv5) → new_psPs14(wv30100, wv30100, wv40100, wv41, wv5)
The graph contains the following edges 1 > 1, 1 > 2, 2 > 3, 2 > 4, 3 >= 5
new_psPs4(:%(Neg(Zero), wv301), :(:%(Neg(Succ(wv40000)), wv401), wv41), wv5) → new_psPs15(wv301, wv401, wv41, wv5)
The graph contains the following edges 1 > 1, 2 > 2, 2 > 3, 3 >= 4
new_psPs4(:%(Neg(Zero), Neg(Succ(wv30100))), :(:%(Pos(Zero), Pos(wv4010)), wv41), wv5) → new_psPs13(Neg(Succ(wv30100)), wv41, wv5)
The graph contains the following edges 1 > 1, 2 > 2, 3 >= 3
new_psPs4(:%(Neg(Zero), Pos(Succ(wv30100))), :(:%(Pos(Zero), Neg(wv4010)), wv41), wv5) → new_psPs13(Pos(Succ(wv30100)), wv41, wv5)
The graph contains the following edges 1 > 1, 2 > 2, 3 >= 3
new_psPs4(:%(Neg(Zero), Pos(Zero)), :(:%(Pos(Zero), Pos(Succ(wv40100))), wv41), wv5) → new_psPs13(Pos(Zero), wv41, wv5)
The graph contains the following edges 1 > 1, 2 > 1, 2 > 2, 3 >= 3
new_psPs4(:%(Neg(Zero), Neg(Zero)), :(:%(Pos(Zero), Pos(Succ(wv40100))), wv41), wv5) → new_psPs13(Neg(Zero), wv41, wv5)
The graph contains the following edges 1 > 1, 2 > 2, 3 >= 3
new_psPs4(:%(Neg(Zero), Neg(Zero)), :(:%(Pos(Zero), Neg(Succ(wv40100))), wv41), wv5) → new_psPs13(Neg(Zero), wv41, wv5)
The graph contains the following edges 1 > 1, 2 > 2, 3 >= 3
new_psPs4(:%(Neg(Zero), Pos(Zero)), :(:%(Pos(Zero), Neg(Succ(wv40100))), wv41), wv5) → new_psPs13(Pos(Zero), wv41, wv5)
The graph contains the following edges 1 > 1, 2 > 1, 2 > 2, 3 >= 3
new_psPs4(:%(Neg(Zero), Pos(Succ(wv30100))), :(:%(Pos(Zero), Pos(Zero)), wv41), wv5) → new_psPs13(Pos(Succ(wv30100)), wv41, wv5)
The graph contains the following edges 1 > 1, 2 > 2, 3 >= 3
new_psPs4(:%(Neg(Zero), Neg(Succ(wv30100))), :(:%(Pos(Zero), Neg(Zero)), wv41), wv5) → new_psPs13(Neg(Succ(wv30100)), wv41, wv5)
The graph contains the following edges 1 > 1, 2 > 2, 3 >= 3
new_psPs12(wv50, Zero, Succ(wv520), wv53, wv54) → new_psPs13(Pos(Succ(wv50)), wv53, wv54)
The graph contains the following edges 4 >= 2, 5 >= 3
new_psPs12(wv50, Succ(wv510), Zero, wv53, wv54) → new_psPs13(Pos(Succ(wv50)), wv53, wv54)
The graph contains the following edges 4 >= 2, 5 >= 3
new_psPs16(Neg(Succ(wv30100)), Pos(wv4010), wv41, wv5) → new_psPs13(Neg(Succ(wv30100)), wv41, wv5)
The graph contains the following edges 1 >= 1, 3 >= 2, 4 >= 3
new_psPs16(Neg(Succ(wv30100)), Neg(Zero), wv41, wv5) → new_psPs13(Neg(Succ(wv30100)), wv41, wv5)
The graph contains the following edges 1 >= 1, 3 >= 2, 4 >= 3
new_psPs16(Neg(Zero), Pos(Succ(wv40100)), wv41, wv5) → new_psPs13(Neg(Zero), wv41, wv5)
The graph contains the following edges 1 >= 1, 3 >= 2, 4 >= 3
new_psPs16(Neg(Zero), Neg(Succ(wv40100)), wv41, wv5) → new_psPs13(Neg(Zero), wv41, wv5)
The graph contains the following edges 1 >= 1, 3 >= 2, 4 >= 3
new_psPs16(Pos(Zero), Neg(Succ(wv40100)), wv41, wv5) → new_psPs13(Pos(Zero), wv41, wv5)
The graph contains the following edges 1 >= 1, 3 >= 2, 4 >= 3
new_psPs16(Pos(Succ(wv30100)), Neg(wv4010), wv41, wv5) → new_psPs13(Pos(Succ(wv30100)), wv41, wv5)
The graph contains the following edges 1 >= 1, 3 >= 2, 4 >= 3
new_psPs16(Pos(Zero), Pos(Succ(wv40100)), wv41, wv5) → new_psPs13(Pos(Zero), wv41, wv5)
The graph contains the following edges 1 >= 1, 3 >= 2, 4 >= 3
new_psPs16(Pos(Succ(wv30100)), Pos(Zero), wv41, wv5) → new_psPs13(Pos(Succ(wv30100)), wv41, wv5)
The graph contains the following edges 1 >= 1, 3 >= 2, 4 >= 3
new_psPs14(wv56, Zero, Succ(wv580), wv59, wv60) → new_psPs13(Neg(Succ(wv56)), wv59, wv60)
The graph contains the following edges 4 >= 2, 5 >= 3
new_psPs14(wv56, Succ(wv570), Zero, wv59, wv60) → new_psPs13(Neg(Succ(wv56)), wv59, wv60)
The graph contains the following edges 4 >= 2, 5 >= 3

↳ HASKELL

  ↳ LR

    ↳ HASKELL

      ↳ CR

        ↳ HASKELL

          ↳ IFR

            ↳ HASKELL

              ↳ BR

                ↳ HASKELL

                  ↳ COR

                    ↳ HASKELL

                      ↳ Narrow

                        ↳ AND

                          ↳ QDP

                          ↳ QDP

                            ↳ QDPSizeChangeProof

Q DP problem:
The TRS P consists of the following rules:

new_foldr(wv4, :(wv30, wv31)) → new_foldr(wv4, wv31)

From the DPs we obtained the following set of size-change graphs:

new_foldr(wv4, :(wv30, wv31)) → new_foldr(wv4, wv31)
The graph contains the following edges 1 >= 1, 2 > 2

intersectBy00	eq ys x	= if any (eq x) ys then x : [] else []
intersectBy00	eq ys _	= []